./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:25:43,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:25:43,672 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:25:43,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:25:43,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:25:43,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:25:43,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:25:43,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:25:43,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:25:43,700 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:25:43,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:25:43,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:25:43,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:25:43,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:25:43,703 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:25:43,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:25:43,704 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:25:43,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:25:43,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:25:43,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:25:43,706 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:25:43,706 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:25:43,707 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:25:43,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:25:43,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:25:43,708 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:25:43,708 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:25:43,708 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:25:43,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:25:43,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:25:43,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:25:43,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:25:43,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:25:43,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:25:43,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:25:43,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:25:43,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:25:43,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:25:43,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:25:43,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:25:43,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:25:43,712 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/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_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2023-11-29 04:25:43,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:25:43,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:25:43,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:25:43,959 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:25:43,959 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:25:43,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2023-11-29 04:25:46,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:25:46,971 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:25:46,971 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2023-11-29 04:25:46,990 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/data/31930ca83/696b56e836f84676b090d8d71422d894/FLAG8ed330676 [2023-11-29 04:25:47,005 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/data/31930ca83/696b56e836f84676b090d8d71422d894 [2023-11-29 04:25:47,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:25:47,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:25:47,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:25:47,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:25:47,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:25:47,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:25:47" (1/1) ... [2023-11-29 04:25:47,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74561b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:47, skipping insertion in model container [2023-11-29 04:25:47,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:25:47" (1/1) ... [2023-11-29 04:25:47,085 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:25:47,603 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:25:47,615 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-11-29 04:25:47,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@124a95b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:47, skipping insertion in model container [2023-11-29 04:25:47,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:25:47,617 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 04:25:47,619 INFO L158 Benchmark]: Toolchain (without parser) took 608.90ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 72.6MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 04:25:47,619 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 52.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:25:47,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.41ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 72.6MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 04:25:47,622 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 52.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.41ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 72.6MB 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: 740]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:25:49,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:25:49,453 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 04:25:49,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:25:49,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:25:49,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:25:49,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:25:49,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:25:49,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:25:49,489 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:25:49,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:25:49,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:25:49,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:25:49,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:25:49,492 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:25:49,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:25:49,493 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:25:49,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:25:49,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:25:49,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:25:49,495 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:25:49,496 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:25:49,496 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:25:49,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:25:49,497 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:25:49,498 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:25:49,498 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:25:49,498 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:25:49,499 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:25:49,499 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:25:49,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:25:49,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:25:49,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:25:49,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:25:49,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:25:49,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:25:49,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:25:49,501 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:25:49,502 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:25:49,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:25:49,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:25:49,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:25:49,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:25:49,503 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:25:49,503 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/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_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2023-11-29 04:25:49,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:25:49,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:25:49,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:25:49,833 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:25:49,833 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:25:49,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2023-11-29 04:25:52,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:25:52,866 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:25:52,867 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-3.i [2023-11-29 04:25:52,885 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/data/18d29a58a/40e095761edb475f861fa43cf93a1df9/FLAG9c5d55b63 [2023-11-29 04:25:52,900 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/data/18d29a58a/40e095761edb475f861fa43cf93a1df9 [2023-11-29 04:25:52,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:25:52,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:25:52,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:25:52,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:25:52,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:25:52,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:25:52" (1/1) ... [2023-11-29 04:25:52,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee94e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:52, skipping insertion in model container [2023-11-29 04:25:52,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:25:52" (1/1) ... [2023-11-29 04:25:53,006 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:25:53,535 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:25:53,549 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 04:25:53,578 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:25:53,671 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:25:53,676 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:25:53,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:25:53,802 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:25:53,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:53 WrapperNode [2023-11-29 04:25:53,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:25:53,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:25:53,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:25:53,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:25:53,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:53" (1/1) ... [2023-11-29 04:25:53,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:53" (1/1) ... [2023-11-29 04:25:53,913 INFO L138 Inliner]: procedures = 180, calls = 439, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1449 [2023-11-29 04:25:53,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:25:53,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:25:53,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:25:53,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:25:53,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:53" (1/1) ... [2023-11-29 04:25:53,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:53" (1/1) ... [2023-11-29 04:25:53,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:53" (1/1) ... [2023-11-29 04:25:54,105 INFO L175 MemorySlicer]: Split 413 memory accesses to 4 slices as follows [2, 5, 5, 401]. 97 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 100 writes are split as follows [0, 1, 1, 98]. [2023-11-29 04:25:54,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:53" (1/1) ... [2023-11-29 04:25:54,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:53" (1/1) ... [2023-11-29 04:25:54,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:53" (1/1) ... [2023-11-29 04:25:54,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:53" (1/1) ... [2023-11-29 04:25:54,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:53" (1/1) ... [2023-11-29 04:25:54,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:53" (1/1) ... [2023-11-29 04:25:54,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:25:54,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:25:54,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:25:54,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:25:54,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:53" (1/1) ... [2023-11-29 04:25:54,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:25:54,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:25:54,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:25:54,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:25:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 04:25:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 04:25:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 04:25:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 04:25:54,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 04:25:54,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 04:25:54,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 04:25:54,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 04:25:54,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 04:25:54,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 04:25:54,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 04:25:54,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 04:25:54,302 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 04:25:54,302 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 04:25:54,302 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 04:25:54,302 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 04:25:54,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:25:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:25:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:25:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:25:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:25:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:25:54,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 04:25:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:25:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:25:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:25:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 04:25:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:25:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:25:54,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:25:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:25:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 04:25:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:25:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:25:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:25:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 04:25:54,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:25:54,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:25:54,547 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:25:54,549 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:25:54,553 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:25:54,607 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:25:54,628 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:25:54,649 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:26:00,342 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:26:00,552 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:26:00,553 INFO L309 CfgBuilder]: Removed 77 assume(true) statements. [2023-11-29 04:26:00,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:26:00 BoogieIcfgContainer [2023-11-29 04:26:00,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:26:00,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:26:00,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:26:00,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:26:00,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:25:52" (1/3) ... [2023-11-29 04:26:00,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577f233a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:26:00, skipping insertion in model container [2023-11-29 04:26:00,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:25:53" (2/3) ... [2023-11-29 04:26:00,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577f233a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:26:00, skipping insertion in model container [2023-11-29 04:26:00,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:26:00" (3/3) ... [2023-11-29 04:26:00,562 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test4-3.i [2023-11-29 04:26:00,577 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:26:00,578 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 851 error locations. [2023-11-29 04:26:00,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:26:00,647 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=PETRI_NET, 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;@6d1b7e07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:26:00,648 INFO L358 AbstractCegarLoop]: Starting to check reachability of 851 error locations. [2023-11-29 04:26:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 1485 states, 632 states have (on average 2.5838607594936707) internal successors, (1633), 1477 states have internal predecessors, (1633), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:26:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 04:26:00,660 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:00,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 04:26:00,661 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr850ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:00,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:00,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2385053, now seen corresponding path program 1 times [2023-11-29 04:26:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:00,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391050929] [2023-11-29 04:26:00,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:00,677 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-11-29 04:26:00,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:00,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:00,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:00,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:26:00,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:00,926 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:00,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:00,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391050929] [2023-11-29 04:26:00,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391050929] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:00,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:00,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:26:00,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739919897] [2023-11-29 04:26:00,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:00,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:26:00,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:00,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:26:00,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:26:00,981 INFO L87 Difference]: Start difference. First operand has 1485 states, 632 states have (on average 2.5838607594936707) internal successors, (1633), 1477 states have internal predecessors, (1633), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:04,143 INFO L93 Difference]: Finished difference Result 1812 states and 1907 transitions. [2023-11-29 04:26:04,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:26:04,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 04:26:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:04,164 INFO L225 Difference]: With dead ends: 1812 [2023-11-29 04:26:04,164 INFO L226 Difference]: Without dead ends: 1809 [2023-11-29 04:26:04,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:26:04,168 INFO L413 NwaCegarLoop]: 1378 mSDtfsCounter, 364 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:04,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 2078 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 04:26:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2023-11-29 04:26:04,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1480. [2023-11-29 04:26:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 638 states have (on average 2.4357366771159876) internal successors, (1554), 1472 states have internal predecessors, (1554), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:26:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1566 transitions. [2023-11-29 04:26:04,258 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1566 transitions. Word has length 3 [2023-11-29 04:26:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:04,259 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1566 transitions. [2023-11-29 04:26:04,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1566 transitions. [2023-11-29 04:26:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 04:26:04,260 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:04,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:26:04,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:04,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:04,461 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:04,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:04,462 INFO L85 PathProgramCache]: Analyzing trace with hash -2005150439, now seen corresponding path program 1 times [2023-11-29 04:26:04,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:04,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464754695] [2023-11-29 04:26:04,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:04,463 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-11-29 04:26:04,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:04,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:04,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:04,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:26:04,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:04,624 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-11-29 04:26:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:04,645 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:04,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:04,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464754695] [2023-11-29 04:26:04,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464754695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:04,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:04,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:26:04,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660545638] [2023-11-29 04:26:04,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:04,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:26:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:04,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:26:04,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:26:04,648 INFO L87 Difference]: Start difference. First operand 1480 states and 1566 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:07,385 INFO L93 Difference]: Finished difference Result 1510 states and 1607 transitions. [2023-11-29 04:26:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:26:07,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 04:26:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:07,394 INFO L225 Difference]: With dead ends: 1510 [2023-11-29 04:26:07,394 INFO L226 Difference]: Without dead ends: 1510 [2023-11-29 04:26:07,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:26:07,396 INFO L413 NwaCegarLoop]: 777 mSDtfsCounter, 1029 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:07,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1030 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 04:26:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2023-11-29 04:26:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1453. [2023-11-29 04:26:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 704 states have (on average 2.25) internal successors, (1584), 1445 states have internal predecessors, (1584), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:26:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1596 transitions. [2023-11-29 04:26:07,433 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1596 transitions. Word has length 5 [2023-11-29 04:26:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:07,434 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 1596 transitions. [2023-11-29 04:26:07,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1596 transitions. [2023-11-29 04:26:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 04:26:07,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:07,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:26:07,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:07,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:07,635 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:07,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:07,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2005150438, now seen corresponding path program 1 times [2023-11-29 04:26:07,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:07,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578098794] [2023-11-29 04:26:07,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:07,637 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-11-29 04:26:07,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:07,638 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:07,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:07,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:26:07,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:07,748 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-11-29 04:26:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:07,771 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:07,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:07,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578098794] [2023-11-29 04:26:07,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578098794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:07,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:07,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:26:07,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225638173] [2023-11-29 04:26:07,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:07,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:26:07,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:07,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:26:07,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:26:07,774 INFO L87 Difference]: Start difference. First operand 1453 states and 1596 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:11,798 INFO L93 Difference]: Finished difference Result 1725 states and 1888 transitions. [2023-11-29 04:26:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:26:11,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 04:26:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:11,806 INFO L225 Difference]: With dead ends: 1725 [2023-11-29 04:26:11,806 INFO L226 Difference]: Without dead ends: 1725 [2023-11-29 04:26:11,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:26:11,807 INFO L413 NwaCegarLoop]: 1105 mSDtfsCounter, 456 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:11,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1626 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 04:26:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2023-11-29 04:26:11,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1576. [2023-11-29 04:26:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 837 states have (on average 2.218637992831541) internal successors, (1857), 1568 states have internal predecessors, (1857), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:26:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1869 transitions. [2023-11-29 04:26:11,839 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1869 transitions. Word has length 5 [2023-11-29 04:26:11,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:11,840 INFO L495 AbstractCegarLoop]: Abstraction has 1576 states and 1869 transitions. [2023-11-29 04:26:11,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1869 transitions. [2023-11-29 04:26:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 04:26:11,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:11,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 04:26:11,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:12,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:12,043 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:12,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2028430167, now seen corresponding path program 1 times [2023-11-29 04:26:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:12,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11729736] [2023-11-29 04:26:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:12,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:26:12,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:12,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:12,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:12,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:26:12,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:12,210 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:12,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:12,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11729736] [2023-11-29 04:26:12,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11729736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:12,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:12,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:26:12,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551698368] [2023-11-29 04:26:12,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:12,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:26:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:12,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:26:12,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:26:12,213 INFO L87 Difference]: Start difference. First operand 1576 states and 1869 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:14,885 INFO L93 Difference]: Finished difference Result 2679 states and 3172 transitions. [2023-11-29 04:26:14,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:26:14,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 04:26:14,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:14,898 INFO L225 Difference]: With dead ends: 2679 [2023-11-29 04:26:14,898 INFO L226 Difference]: Without dead ends: 2679 [2023-11-29 04:26:14,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:26:14,899 INFO L413 NwaCegarLoop]: 1275 mSDtfsCounter, 1072 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 3550 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:14,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 3550 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 04:26:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2023-11-29 04:26:14,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 2022. [2023-11-29 04:26:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 1283 states have (on average 2.176149649259548) internal successors, (2792), 2011 states have internal predecessors, (2792), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:26:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2810 transitions. [2023-11-29 04:26:14,952 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2810 transitions. Word has length 6 [2023-11-29 04:26:14,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:14,952 INFO L495 AbstractCegarLoop]: Abstraction has 2022 states and 2810 transitions. [2023-11-29 04:26:14,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2810 transitions. [2023-11-29 04:26:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 04:26:14,953 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:14,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:14,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:15,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:15,154 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr647REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:15,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:15,155 INFO L85 PathProgramCache]: Analyzing trace with hash 593798675, now seen corresponding path program 1 times [2023-11-29 04:26:15,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:15,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085096814] [2023-11-29 04:26:15,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:15,156 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-11-29 04:26:15,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:15,157 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:15,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:15,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:26:15,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:15,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:15,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:15,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085096814] [2023-11-29 04:26:15,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085096814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:15,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:15,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:26:15,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21718238] [2023-11-29 04:26:15,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:15,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:26:15,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:15,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:26:15,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:26:15,318 INFO L87 Difference]: Start difference. First operand 2022 states and 2810 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-11-29 04:26:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:16,778 INFO L93 Difference]: Finished difference Result 2304 states and 2944 transitions. [2023-11-29 04:26:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:26:16,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-11-29 04:26:16,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:16,791 INFO L225 Difference]: With dead ends: 2304 [2023-11-29 04:26:16,791 INFO L226 Difference]: Without dead ends: 2304 [2023-11-29 04:26:16,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-29 04:26:16,792 INFO L413 NwaCegarLoop]: 1326 mSDtfsCounter, 543 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:16,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 2487 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 04:26:16,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2023-11-29 04:26:16,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 1913. [2023-11-29 04:26:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1174 states have (on average 2.183986371379898) internal successors, (2564), 1902 states have internal predecessors, (2564), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:26:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2582 transitions. [2023-11-29 04:26:16,830 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2582 transitions. Word has length 8 [2023-11-29 04:26:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:16,830 INFO L495 AbstractCegarLoop]: Abstraction has 1913 states and 2582 transitions. [2023-11-29 04:26:16,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-11-29 04:26:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2582 transitions. [2023-11-29 04:26:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:26:16,831 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:16,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:16,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-29 04:26:17,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:17,033 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr649REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:17,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:17,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1106372499, now seen corresponding path program 1 times [2023-11-29 04:26:17,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:17,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909134905] [2023-11-29 04:26:17,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:17,034 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-11-29 04:26:17,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:17,035 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:17,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:17,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:26:17,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:17,215 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:17,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:17,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909134905] [2023-11-29 04:26:17,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909134905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:17,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:17,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:26:17,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435608892] [2023-11-29 04:26:17,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:17,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:26:17,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:17,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:26:17,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:26:17,217 INFO L87 Difference]: Start difference. First operand 1913 states and 2582 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:19,849 INFO L93 Difference]: Finished difference Result 2304 states and 2943 transitions. [2023-11-29 04:26:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:26:19,850 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 04:26:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:19,861 INFO L225 Difference]: With dead ends: 2304 [2023-11-29 04:26:19,861 INFO L226 Difference]: Without dead ends: 2298 [2023-11-29 04:26:19,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-11-29 04:26:19,862 INFO L413 NwaCegarLoop]: 1326 mSDtfsCounter, 549 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 3619 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:19,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 3619 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 04:26:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2023-11-29 04:26:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1907. [2023-11-29 04:26:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1168 states have (on average 2.1892123287671232) internal successors, (2557), 1896 states have internal predecessors, (2557), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:26:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2575 transitions. [2023-11-29 04:26:19,910 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2575 transitions. Word has length 11 [2023-11-29 04:26:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:19,910 INFO L495 AbstractCegarLoop]: Abstraction has 1907 states and 2575 transitions. [2023-11-29 04:26:19,910 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), 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-11-29 04:26:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2575 transitions. [2023-11-29 04:26:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:26:19,911 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:19,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:19,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:20,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:20,113 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:20,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:20,113 INFO L85 PathProgramCache]: Analyzing trace with hash -251212221, now seen corresponding path program 1 times [2023-11-29 04:26:20,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:20,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875778065] [2023-11-29 04:26:20,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:20,114 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-11-29 04:26:20,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:20,115 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:20,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:20,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:26:20,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:20,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:20,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:20,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875778065] [2023-11-29 04:26:20,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875778065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:20,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:20,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:26:20,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988510970] [2023-11-29 04:26:20,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:20,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:26:20,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:20,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:26:20,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:26:20,264 INFO L87 Difference]: Start difference. First operand 1907 states and 2575 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:21,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:21,408 INFO L93 Difference]: Finished difference Result 1853 states and 2495 transitions. [2023-11-29 04:26:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:26:21,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 04:26:21,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:21,417 INFO L225 Difference]: With dead ends: 1853 [2023-11-29 04:26:21,417 INFO L226 Difference]: Without dead ends: 1853 [2023-11-29 04:26:21,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:26:21,418 INFO L413 NwaCegarLoop]: 1229 mSDtfsCounter, 70 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:21,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2409 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 04:26:21,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2023-11-29 04:26:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1853. [2023-11-29 04:26:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1138 states have (on average 2.1766256590509667) internal successors, (2477), 1842 states have internal predecessors, (2477), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:26:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2495 transitions. [2023-11-29 04:26:21,464 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2495 transitions. Word has length 11 [2023-11-29 04:26:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:21,464 INFO L495 AbstractCegarLoop]: Abstraction has 1853 states and 2495 transitions. [2023-11-29 04:26:21,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2495 transitions. [2023-11-29 04:26:21,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 04:26:21,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:21,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:21,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 04:26:21,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:21,666 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:21,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:21,666 INFO L85 PathProgramCache]: Analyzing trace with hash -896778947, now seen corresponding path program 1 times [2023-11-29 04:26:21,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:21,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663111252] [2023-11-29 04:26:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:21,667 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-11-29 04:26:21,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:21,668 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:21,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:21,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:26:21,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:21,816 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:21,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:21,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663111252] [2023-11-29 04:26:21,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663111252] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:21,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:21,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:26:21,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673397265] [2023-11-29 04:26:21,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:21,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:26:21,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:21,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:26:21,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:26:21,818 INFO L87 Difference]: Start difference. First operand 1853 states and 2495 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:23,231 INFO L93 Difference]: Finished difference Result 1839 states and 2453 transitions. [2023-11-29 04:26:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:26:23,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 04:26:23,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:23,240 INFO L225 Difference]: With dead ends: 1839 [2023-11-29 04:26:23,240 INFO L226 Difference]: Without dead ends: 1839 [2023-11-29 04:26:23,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:26:23,241 INFO L413 NwaCegarLoop]: 1198 mSDtfsCounter, 58 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3570 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:23,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3570 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 04:26:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2023-11-29 04:26:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1837. [2023-11-29 04:26:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1136 states have (on average 2.141725352112676) internal successors, (2433), 1826 states have internal predecessors, (2433), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:26:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2451 transitions. [2023-11-29 04:26:23,266 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2451 transitions. Word has length 13 [2023-11-29 04:26:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:23,266 INFO L495 AbstractCegarLoop]: Abstraction has 1837 states and 2451 transitions. [2023-11-29 04:26:23,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2451 transitions. [2023-11-29 04:26:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 04:26:23,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:23,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:23,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 04:26:23,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:23,471 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:23,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:23,471 INFO L85 PathProgramCache]: Analyzing trace with hash 80004107, now seen corresponding path program 1 times [2023-11-29 04:26:23,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:23,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806502148] [2023-11-29 04:26:23,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:23,472 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-11-29 04:26:23,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:23,473 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:23,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:23,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:26:23,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:23,624 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-11-29 04:26:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:23,692 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:23,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:23,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806502148] [2023-11-29 04:26:23,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806502148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:23,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:23,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:26:23,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59609016] [2023-11-29 04:26:23,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:23,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:26:23,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:23,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:26:23,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:26:23,694 INFO L87 Difference]: Start difference. First operand 1837 states and 2451 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:27,027 INFO L93 Difference]: Finished difference Result 1890 states and 2454 transitions. [2023-11-29 04:26:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:26:27,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 04:26:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:27,035 INFO L225 Difference]: With dead ends: 1890 [2023-11-29 04:26:27,035 INFO L226 Difference]: Without dead ends: 1890 [2023-11-29 04:26:27,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:26:27,036 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 964 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:27,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1519 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 04:26:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2023-11-29 04:26:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1833. [2023-11-29 04:26:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1136 states have (on average 2.1346830985915495) internal successors, (2425), 1822 states have internal predecessors, (2425), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:26:27,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2443 transitions. [2023-11-29 04:26:27,063 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2443 transitions. Word has length 27 [2023-11-29 04:26:27,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:27,063 INFO L495 AbstractCegarLoop]: Abstraction has 1833 states and 2443 transitions. [2023-11-29 04:26:27,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2443 transitions. [2023-11-29 04:26:27,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 04:26:27,064 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:27,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:27,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:27,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:27,265 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:27,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:27,266 INFO L85 PathProgramCache]: Analyzing trace with hash 80004108, now seen corresponding path program 1 times [2023-11-29 04:26:27,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:27,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049270620] [2023-11-29 04:26:27,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:27,267 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-11-29 04:26:27,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:27,268 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:27,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:27,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:26:27,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:27,440 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-11-29 04:26:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:27,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:27,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:27,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049270620] [2023-11-29 04:26:27,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049270620] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:27,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:27,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:26:27,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877483749] [2023-11-29 04:26:27,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:27,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:26:27,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:27,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:26:27,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:26:27,602 INFO L87 Difference]: Start difference. First operand 1833 states and 2443 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:32,800 INFO L93 Difference]: Finished difference Result 1978 states and 2454 transitions. [2023-11-29 04:26:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:26:32,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 04:26:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:32,809 INFO L225 Difference]: With dead ends: 1978 [2023-11-29 04:26:32,809 INFO L226 Difference]: Without dead ends: 1978 [2023-11-29 04:26:32,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:26:32,810 INFO L413 NwaCegarLoop]: 1301 mSDtfsCounter, 393 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:32,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 2516 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1979 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-11-29 04:26:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2023-11-29 04:26:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1829. [2023-11-29 04:26:32,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1136 states have (on average 2.1276408450704225) internal successors, (2417), 1818 states have internal predecessors, (2417), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:26:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2435 transitions. [2023-11-29 04:26:32,839 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2435 transitions. Word has length 27 [2023-11-29 04:26:32,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:32,839 INFO L495 AbstractCegarLoop]: Abstraction has 1829 states and 2435 transitions. [2023-11-29 04:26:32,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2435 transitions. [2023-11-29 04:26:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 04:26:32,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:32,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:32,844 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:33,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:33,042 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:33,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:33,042 INFO L85 PathProgramCache]: Analyzing trace with hash 935617745, now seen corresponding path program 1 times [2023-11-29 04:26:33,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:33,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743167219] [2023-11-29 04:26:33,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:33,043 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-11-29 04:26:33,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:33,044 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:33,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:33,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:26:33,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:33,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:33,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:33,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743167219] [2023-11-29 04:26:33,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743167219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:33,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:33,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:26:33,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548251045] [2023-11-29 04:26:33,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:33,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:26:33,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:33,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:26:33,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:26:33,289 INFO L87 Difference]: Start difference. First operand 1829 states and 2435 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:34,685 INFO L93 Difference]: Finished difference Result 1817 states and 2415 transitions. [2023-11-29 04:26:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:26:34,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-11-29 04:26:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:34,694 INFO L225 Difference]: With dead ends: 1817 [2023-11-29 04:26:34,694 INFO L226 Difference]: Without dead ends: 1817 [2023-11-29 04:26:34,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-11-29 04:26:34,694 INFO L413 NwaCegarLoop]: 1192 mSDtfsCounter, 23 mSDsluCounter, 2364 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3556 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:34,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3556 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 04:26:34,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2023-11-29 04:26:34,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1817. [2023-11-29 04:26:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1124 states have (on average 2.132562277580071) internal successors, (2397), 1806 states have internal predecessors, (2397), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:26:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2415 transitions. [2023-11-29 04:26:34,714 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2415 transitions. Word has length 46 [2023-11-29 04:26:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:34,715 INFO L495 AbstractCegarLoop]: Abstraction has 1817 states and 2415 transitions. [2023-11-29 04:26:34,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2415 transitions. [2023-11-29 04:26:34,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 04:26:34,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:34,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:34,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:34,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:34,916 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:34,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 560683185, now seen corresponding path program 1 times [2023-11-29 04:26:34,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:34,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322140581] [2023-11-29 04:26:34,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:34,918 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-11-29 04:26:34,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:34,918 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:34,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:35,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:26:35,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:35,256 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-11-29 04:26:35,262 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-11-29 04:26:35,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:26:35,742 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-11-29 04:26:35,759 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:26:35,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:26:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:35,781 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:35,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:35,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322140581] [2023-11-29 04:26:35,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322140581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:35,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:35,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:26:35,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484445686] [2023-11-29 04:26:35,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:35,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:26:35,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:35,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:26:35,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:26:35,783 INFO L87 Difference]: Start difference. First operand 1817 states and 2415 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:39,641 INFO L93 Difference]: Finished difference Result 1789 states and 2299 transitions. [2023-11-29 04:26:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:26:39,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-29 04:26:39,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:39,648 INFO L225 Difference]: With dead ends: 1789 [2023-11-29 04:26:39,648 INFO L226 Difference]: Without dead ends: 1789 [2023-11-29 04:26:39,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:26:39,649 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 943 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:39,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 860 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 04:26:39,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2023-11-29 04:26:39,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1600. [2023-11-29 04:26:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 991 states have (on average 2.005045408678103) internal successors, (1987), 1589 states have internal predecessors, (1987), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:26:39,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2005 transitions. [2023-11-29 04:26:39,668 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2005 transitions. Word has length 50 [2023-11-29 04:26:39,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:39,668 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 2005 transitions. [2023-11-29 04:26:39,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2005 transitions. [2023-11-29 04:26:39,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 04:26:39,670 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:39,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:39,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:39,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:39,870 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:39,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:39,871 INFO L85 PathProgramCache]: Analyzing trace with hash -852831317, now seen corresponding path program 1 times [2023-11-29 04:26:39,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:39,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462542609] [2023-11-29 04:26:39,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:39,871 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-11-29 04:26:39,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:39,872 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:39,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:40,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:26:40,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:40,128 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-11-29 04:26:40,142 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-11-29 04:26:40,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:26:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:40,173 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:40,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:40,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462542609] [2023-11-29 04:26:40,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462542609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:40,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:40,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:26:40,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299098739] [2023-11-29 04:26:40,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:40,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:26:40,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:40,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:26:40,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:26:40,174 INFO L87 Difference]: Start difference. First operand 1600 states and 2005 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:44,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:44,188 INFO L93 Difference]: Finished difference Result 1599 states and 2003 transitions. [2023-11-29 04:26:44,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:26:44,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 04:26:44,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:44,195 INFO L225 Difference]: With dead ends: 1599 [2023-11-29 04:26:44,195 INFO L226 Difference]: Without dead ends: 1599 [2023-11-29 04:26:44,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:26:44,196 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 3 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:44,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2796 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 04:26:44,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2023-11-29 04:26:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2023-11-29 04:26:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 991 states have (on average 2.003027245206862) internal successors, (1985), 1588 states have internal predecessors, (1985), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:26:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2003 transitions. [2023-11-29 04:26:44,225 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2003 transitions. Word has length 54 [2023-11-29 04:26:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:44,226 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2003 transitions. [2023-11-29 04:26:44,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2003 transitions. [2023-11-29 04:26:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 04:26:44,227 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:44,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:44,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:44,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:44,432 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:44,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:44,433 INFO L85 PathProgramCache]: Analyzing trace with hash -852831316, now seen corresponding path program 1 times [2023-11-29 04:26:44,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:44,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176908386] [2023-11-29 04:26:44,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:44,434 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-11-29 04:26:44,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:44,435 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:44,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:44,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 04:26:44,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:44,663 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-11-29 04:26:44,680 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-11-29 04:26:44,691 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-11-29 04:26:44,727 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-11-29 04:26:44,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:44,746 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:44,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:44,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176908386] [2023-11-29 04:26:44,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176908386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:44,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:44,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:26:44,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242839621] [2023-11-29 04:26:44,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:44,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:26:44,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:44,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:26:44,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:26:44,748 INFO L87 Difference]: Start difference. First operand 1599 states and 2003 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:50,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:50,153 INFO L93 Difference]: Finished difference Result 1598 states and 2001 transitions. [2023-11-29 04:26:50,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:26:50,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 04:26:50,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:50,159 INFO L225 Difference]: With dead ends: 1598 [2023-11-29 04:26:50,159 INFO L226 Difference]: Without dead ends: 1598 [2023-11-29 04:26:50,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:26:50,160 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 1 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 2224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:50,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2845 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2224 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-11-29 04:26:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2023-11-29 04:26:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2023-11-29 04:26:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 989 states have (on average 2.005055611729019) internal successors, (1983), 1587 states have internal predecessors, (1983), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:26:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2001 transitions. [2023-11-29 04:26:50,178 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2001 transitions. Word has length 54 [2023-11-29 04:26:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:50,179 INFO L495 AbstractCegarLoop]: Abstraction has 1598 states and 2001 transitions. [2023-11-29 04:26:50,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:26:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2001 transitions. [2023-11-29 04:26:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 04:26:50,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:50,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:50,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:50,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:50,380 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:50,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash 980342063, now seen corresponding path program 1 times [2023-11-29 04:26:50,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:50,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427499205] [2023-11-29 04:26:50,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:50,381 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-11-29 04:26:50,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:50,382 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:50,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:50,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:26:50,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:50,654 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:26:50,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:50,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427499205] [2023-11-29 04:26:50,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427499205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:26:50,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:26:50,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:26:50,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614956295] [2023-11-29 04:26:50,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:26:50,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:26:50,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:50,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:26:50,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:26:50,656 INFO L87 Difference]: Start difference. First operand 1598 states and 2001 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:26:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:51,993 INFO L93 Difference]: Finished difference Result 1600 states and 2006 transitions. [2023-11-29 04:26:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:26:51,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2023-11-29 04:26:51,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:52,003 INFO L225 Difference]: With dead ends: 1600 [2023-11-29 04:26:52,003 INFO L226 Difference]: Without dead ends: 1600 [2023-11-29 04:26:52,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:26:52,004 INFO L413 NwaCegarLoop]: 1119 mSDtfsCounter, 1 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:52,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3351 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 04:26:52,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2023-11-29 04:26:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1600. [2023-11-29 04:26:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 990 states have (on average 2.005050505050505) internal successors, (1985), 1589 states have internal predecessors, (1985), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 04:26:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2006 transitions. [2023-11-29 04:26:52,032 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2006 transitions. Word has length 60 [2023-11-29 04:26:52,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:52,033 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 2006 transitions. [2023-11-29 04:26:52,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:26:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2006 transitions. [2023-11-29 04:26:52,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 04:26:52,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:52,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:52,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:52,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:52,235 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:52,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:52,235 INFO L85 PathProgramCache]: Analyzing trace with hash -160912010, now seen corresponding path program 1 times [2023-11-29 04:26:52,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:52,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133494389] [2023-11-29 04:26:52,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:52,236 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-11-29 04:26:52,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:52,236 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:52,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:52,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:26:52,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:52,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:26:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:52,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:52,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133494389] [2023-11-29 04:26:52,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133494389] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:26:52,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:26:52,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 04:26:52,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466659760] [2023-11-29 04:26:52,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:26:52,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:26:52,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:52,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:26:52,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:26:52,570 INFO L87 Difference]: Start difference. First operand 1600 states and 2006 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:26:54,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:54,121 INFO L93 Difference]: Finished difference Result 1609 states and 2022 transitions. [2023-11-29 04:26:54,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:26:54,123 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2023-11-29 04:26:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:54,126 INFO L225 Difference]: With dead ends: 1609 [2023-11-29 04:26:54,126 INFO L226 Difference]: Without dead ends: 1609 [2023-11-29 04:26:54,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:26:54,127 INFO L413 NwaCegarLoop]: 1117 mSDtfsCounter, 6 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3347 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:54,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3347 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 04:26:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2023-11-29 04:26:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1608. [2023-11-29 04:26:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 997 states have (on average 2.004012036108325) internal successors, (1998), 1596 states have internal predecessors, (1998), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 04:26:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2019 transitions. [2023-11-29 04:26:54,155 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2019 transitions. Word has length 61 [2023-11-29 04:26:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:54,155 INFO L495 AbstractCegarLoop]: Abstraction has 1608 states and 2019 transitions. [2023-11-29 04:26:54,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:26:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2019 transitions. [2023-11-29 04:26:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 04:26:54,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:54,157 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:54,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:54,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:54,357 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:54,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:54,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1447440111, now seen corresponding path program 2 times [2023-11-29 04:26:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:54,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867582894] [2023-11-29 04:26:54,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:26:54,358 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-11-29 04:26:54,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:54,359 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:54,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:54,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:26:54,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:26:54,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:26:54,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:54,826 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:26:54,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:26:54,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:54,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867582894] [2023-11-29 04:26:54,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867582894] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:26:54,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:26:54,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 04:26:54,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694816601] [2023-11-29 04:26:54,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:26:54,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:26:54,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:54,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:26:54,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:26:54,968 INFO L87 Difference]: Start difference. First operand 1608 states and 2019 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:26:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:59,435 INFO L93 Difference]: Finished difference Result 1623 states and 2049 transitions. [2023-11-29 04:26:59,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 04:26:59,436 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2023-11-29 04:26:59,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:59,439 INFO L225 Difference]: With dead ends: 1623 [2023-11-29 04:26:59,439 INFO L226 Difference]: Without dead ends: 1621 [2023-11-29 04:26:59,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 04:26:59,440 INFO L413 NwaCegarLoop]: 1117 mSDtfsCounter, 12 mSDsluCounter, 10025 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 11142 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:59,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 11142 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 04:26:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2023-11-29 04:26:59,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1617. [2023-11-29 04:26:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1006 states have (on average 1.9980119284294235) internal successors, (2010), 1605 states have internal predecessors, (2010), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 04:26:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2031 transitions. [2023-11-29 04:26:59,461 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2031 transitions. Word has length 64 [2023-11-29 04:26:59,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:59,462 INFO L495 AbstractCegarLoop]: Abstraction has 1617 states and 2031 transitions. [2023-11-29 04:26:59,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:26:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2031 transitions. [2023-11-29 04:26:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:26:59,463 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:59,463 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:26:59,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:59,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:59,664 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:26:59,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1829842545, now seen corresponding path program 3 times [2023-11-29 04:26:59,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:59,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001864991] [2023-11-29 04:26:59,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:26:59,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:26:59,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:59,666 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:26:59,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:27:00,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 04:27:00,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:27:00,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:27:00,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:27:00,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:27:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:27:00,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:27:00,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001864991] [2023-11-29 04:27:00,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001864991] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:27:00,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:27:00,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 04:27:00,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466219375] [2023-11-29 04:27:00,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:27:00,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 04:27:00,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:27:00,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 04:27:00,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:27:00,958 INFO L87 Difference]: Start difference. First operand 1617 states and 2031 transitions. Second operand has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:27:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:09,879 INFO L93 Difference]: Finished difference Result 1647 states and 2109 transitions. [2023-11-29 04:27:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 04:27:09,880 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2023-11-29 04:27:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:09,883 INFO L225 Difference]: With dead ends: 1647 [2023-11-29 04:27:09,883 INFO L226 Difference]: Without dead ends: 1644 [2023-11-29 04:27:09,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 04:27:09,885 INFO L413 NwaCegarLoop]: 1115 mSDtfsCounter, 24 mSDsluCounter, 16681 mSDsCounter, 0 mSdLazyCounter, 3357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 17796 SdHoareTripleChecker+Invalid, 3378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:09,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 17796 Invalid, 3378 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 3357 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2023-11-29 04:27:09,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2023-11-29 04:27:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1635. [2023-11-29 04:27:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1024 states have (on average 1.9853515625) internal successors, (2033), 1623 states have internal predecessors, (2033), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 04:27:09,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2054 transitions. [2023-11-29 04:27:09,918 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2054 transitions. Word has length 70 [2023-11-29 04:27:09,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:09,918 INFO L495 AbstractCegarLoop]: Abstraction has 1635 states and 2054 transitions. [2023-11-29 04:27:09,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:27:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2054 transitions. [2023-11-29 04:27:09,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 04:27:09,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:09,919 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:27:09,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:27:10,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:27:10,120 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:27:10,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:10,121 INFO L85 PathProgramCache]: Analyzing trace with hash -274420017, now seen corresponding path program 4 times [2023-11-29 04:27:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:27:10,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161427157] [2023-11-29 04:27:10,122 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:27:10,122 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-11-29 04:27:10,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:27:10,123 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:27:10,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:27:10,486 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:27:10,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:27:10,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 04:27:10,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:27:10,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:27:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:27:12,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:27:12,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161427157] [2023-11-29 04:27:12,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161427157] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:27:12,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:27:12,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 04:27:12,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66865241] [2023-11-29 04:27:12,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:27:12,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 04:27:12,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:27:12,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 04:27:12,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 04:27:12,400 INFO L87 Difference]: Start difference. First operand 1635 states and 2054 transitions. Second operand has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:27:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:31,117 INFO L93 Difference]: Finished difference Result 1692 states and 2185 transitions. [2023-11-29 04:27:31,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 04:27:31,118 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2023-11-29 04:27:31,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:31,122 INFO L225 Difference]: With dead ends: 1692 [2023-11-29 04:27:31,122 INFO L226 Difference]: Without dead ends: 1690 [2023-11-29 04:27:31,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 04:27:31,126 INFO L413 NwaCegarLoop]: 1117 mSDtfsCounter, 48 mSDsluCounter, 26758 mSDsCounter, 0 mSdLazyCounter, 6643 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 27875 SdHoareTripleChecker+Invalid, 6786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 6643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:31,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 27875 Invalid, 6786 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [143 Valid, 6643 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2023-11-29 04:27:31,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2023-11-29 04:27:31,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1669. [2023-11-29 04:27:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1058 states have (on average 1.9650283553875236) internal successors, (2079), 1657 states have internal predecessors, (2079), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 04:27:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2023-11-29 04:27:31,152 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 82 [2023-11-29 04:27:31,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:31,152 INFO L495 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2023-11-29 04:27:31,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:27:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2023-11-29 04:27:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 04:27:31,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:31,153 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] [2023-11-29 04:27:31,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:27:31,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:27:31,354 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:27:31,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash 151097455, now seen corresponding path program 5 times [2023-11-29 04:27:31,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:27:31,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765343468] [2023-11-29 04:27:31,355 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:27:31,355 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-11-29 04:27:31,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:27:31,356 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:27:31,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:27:32,797 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 04:27:32,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:27:32,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 04:27:32,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:32,856 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 04:27:32,856 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 22 [2023-11-29 04:27:33,254 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 04:27:33,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-29 04:27:33,340 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-11-29 04:27:33,492 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 42 treesize of output 24 [2023-11-29 04:27:36,253 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:27:36,253 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 59 [2023-11-29 04:27:36,330 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 51 treesize of output 27 [2023-11-29 04:27:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:27:36,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:27:36,807 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1592) |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-11-29 04:27:36,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:27:36,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765343468] [2023-11-29 04:27:36,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765343468] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:27:36,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [36641969] [2023-11-29 04:27:36,810 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:27:36,810 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:27:36,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:27:36,811 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:27:36,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-11-29 04:28:42,730 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 04:28:42,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:28:42,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 04:28:42,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:28:42,989 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:28:42,989 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-11-29 04:28:43,367 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 04:28:43,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 04:28:43,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:28:44,104 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:28:44,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 04:28:44,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 04:28:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:28:44,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:28:44,641 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-11-29 04:28:44,641 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-11-29 04:28:44,649 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2036) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 04:28:44,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [36641969] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:28:44,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:28:44,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 18 [2023-11-29 04:28:44,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919717591] [2023-11-29 04:28:44,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:28:44,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 04:28:44,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:28:44,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 04:28:44,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=410, Unknown=2, NotChecked=82, Total=552 [2023-11-29 04:28:44,653 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 18 states have internal predecessors, (120), 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-11-29 04:29:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:29:16,777 INFO L93 Difference]: Finished difference Result 2979 states and 3454 transitions. [2023-11-29 04:29:16,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 04:29:16,778 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 18 states have internal predecessors, (120), 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 104 [2023-11-29 04:29:16,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:29:16,783 INFO L225 Difference]: With dead ends: 2979 [2023-11-29 04:29:16,783 INFO L226 Difference]: Without dead ends: 2975 [2023-11-29 04:29:16,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=271, Invalid=1627, Unknown=2, NotChecked=170, Total=2070 [2023-11-29 04:29:16,784 INFO L413 NwaCegarLoop]: 837 mSDtfsCounter, 4737 mSDsluCounter, 11843 mSDsCounter, 0 mSdLazyCounter, 16910 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4737 SdHoareTripleChecker+Valid, 12680 SdHoareTripleChecker+Invalid, 17045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 16910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:29:16,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4737 Valid, 12680 Invalid, 17045 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [135 Valid, 16910 Invalid, 0 Unknown, 0 Unchecked, 31.0s Time] [2023-11-29 04:29:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2023-11-29 04:29:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2118. [2023-11-29 04:29:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2118 states, 1502 states have (on average 1.8521970705725699) internal successors, (2782), 2098 states have internal predecessors, (2782), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 04:29:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 2817 transitions. [2023-11-29 04:29:16,818 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 2817 transitions. Word has length 104 [2023-11-29 04:29:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:29:16,818 INFO L495 AbstractCegarLoop]: Abstraction has 2118 states and 2817 transitions. [2023-11-29 04:29:16,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 18 states have internal predecessors, (120), 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-11-29 04:29:16,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 2817 transitions. [2023-11-29 04:29:16,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 04:29:16,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:29:16,819 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] [2023-11-29 04:29:16,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:29:17,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2023-11-29 04:29:17,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:29:17,220 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:29:17,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:29:17,220 INFO L85 PathProgramCache]: Analyzing trace with hash 151097456, now seen corresponding path program 1 times [2023-11-29 04:29:17,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:29:17,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954104110] [2023-11-29 04:29:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:29:17,221 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-11-29 04:29:17,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:29:17,222 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:29:17,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:29:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:29:17,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 04:29:17,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:29:17,988 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-11-29 04:29:18,221 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:29:18,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-11-29 04:29:18,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:29:18,254 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-11-29 04:29:18,263 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-11-29 04:29:18,368 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-11-29 04:29:18,373 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-11-29 04:29:18,977 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:29:18,977 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-11-29 04:29:18,987 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-11-29 04:29:19,026 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-11-29 04:29:19,030 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-11-29 04:29:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:29:19,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:29:20,422 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 04:29:20,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:29:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954104110] [2023-11-29 04:29:20,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954104110] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:29:20,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1590518913] [2023-11-29 04:29:20,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:29:20,429 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:29:20,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:29:20,430 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:29:20,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-11-29 04:31:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:06,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 04:31:06,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:31:06,619 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-11-29 04:31:06,838 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:31:06,838 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-11-29 04:31:06,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:31:06,863 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-11-29 04:31:06,875 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-11-29 04:31:06,927 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-11-29 04:31:06,931 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-11-29 04:31:07,533 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:31:07,534 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-11-29 04:31:07,544 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-11-29 04:31:07,580 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-11-29 04:31:07,585 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-11-29 04:31:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:31:07,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:31:08,881 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3110) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:31:08,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1590518913] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:31:08,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:31:08,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 04:31:08,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219035883] [2023-11-29 04:31:08,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:31:08,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:31:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:31:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:31:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 04:31:08,888 INFO L87 Difference]: Start difference. First operand 2118 states and 2817 transitions. Second operand has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 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-11-29 04:31:21,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:21,196 INFO L93 Difference]: Finished difference Result 2461 states and 3126 transitions. [2023-11-29 04:31:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:31:21,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 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 104 [2023-11-29 04:31:21,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:21,200 INFO L225 Difference]: With dead ends: 2461 [2023-11-29 04:31:21,201 INFO L226 Difference]: Without dead ends: 2461 [2023-11-29 04:31:21,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 04:31:21,201 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 706 mSDsluCounter, 2353 mSDsCounter, 0 mSdLazyCounter, 5059 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 3335 SdHoareTripleChecker+Invalid, 5070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:21,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 3335 Invalid, 5070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 5059 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2023-11-29 04:31:21,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2023-11-29 04:31:21,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2117. [2023-11-29 04:31:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 1502 states have (on average 1.8501997336884155) internal successors, (2779), 2097 states have internal predecessors, (2779), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 04:31:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 2814 transitions. [2023-11-29 04:31:21,230 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 2814 transitions. Word has length 104 [2023-11-29 04:31:21,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:21,231 INFO L495 AbstractCegarLoop]: Abstraction has 2117 states and 2814 transitions. [2023-11-29 04:31:21,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 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-11-29 04:31:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2814 transitions. [2023-11-29 04:31:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 04:31:21,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:21,232 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:31:21,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-11-29 04:31:21,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2023-11-29 04:31:21,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:31:21,633 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:31:21,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:21,633 INFO L85 PathProgramCache]: Analyzing trace with hash -822164495, now seen corresponding path program 1 times [2023-11-29 04:31:21,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:31:21,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214838250] [2023-11-29 04:31:21,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:21,634 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-11-29 04:31:21,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:31:21,635 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:31:21,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-29 04:31:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:22,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 04:31:22,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:31:22,460 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-11-29 04:31:22,568 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:31:22,568 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-11-29 04:31:22,600 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-11-29 04:31:22,694 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-11-29 04:31:23,514 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:31:23,514 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-11-29 04:31:23,610 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:31:23,610 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-11-29 04:31:23,622 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-11-29 04:31:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:31:23,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:31:23,705 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3516) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2023-11-29 04:31:28,177 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3562 (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$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3562))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3516)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:31:28,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:31:28,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214838250] [2023-11-29 04:31:28,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214838250] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:31:28,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1877476617] [2023-11-29 04:31:28,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:28,181 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:31:28,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:31:28,182 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:31:28,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-11-29 04:31:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:30,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 04:31:30,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:31:30,623 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:31:30,624 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-11-29 04:31:31,114 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 04:31:31,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 04:31:31,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:31:31,913 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:31:31,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 04:31:32,097 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:31:32,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 04:31:32,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 04:31:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:31:32,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:31:32,315 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3967 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3967) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:31:32,768 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-11-29 04:31:32,768 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-11-29 04:31:32,781 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4013))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3967)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 04:31:32,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1877476617] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:31:32,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:31:32,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2023-11-29 04:31:32,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463132778] [2023-11-29 04:31:32,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:31:32,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 04:31:32,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:31:32,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 04:31:32,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=521, Unknown=9, NotChecked=196, Total=812 [2023-11-29 04:31:32,785 INFO L87 Difference]: Start difference. First operand 2117 states and 2814 transitions. Second operand has 21 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 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-11-29 04:32:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:32:08,040 INFO L93 Difference]: Finished difference Result 2971 states and 3440 transitions. [2023-11-29 04:32:08,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 04:32:08,041 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 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 106 [2023-11-29 04:32:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:32:08,046 INFO L225 Difference]: With dead ends: 2971 [2023-11-29 04:32:08,046 INFO L226 Difference]: Without dead ends: 2971 [2023-11-29 04:32:08,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=212, Invalid=1277, Unknown=9, NotChecked=308, Total=1806 [2023-11-29 04:32:08,048 INFO L413 NwaCegarLoop]: 1008 mSDtfsCounter, 1882 mSDsluCounter, 12005 mSDsCounter, 0 mSdLazyCounter, 16036 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 13013 SdHoareTripleChecker+Invalid, 16077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 16036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:32:08,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 13013 Invalid, 16077 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [41 Valid, 16036 Invalid, 0 Unknown, 0 Unchecked, 34.2s Time] [2023-11-29 04:32:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2023-11-29 04:32:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2116. [2023-11-29 04:32:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 1502 states have (on average 1.848202396804261) internal successors, (2776), 2096 states have internal predecessors, (2776), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 04:32:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2811 transitions. [2023-11-29 04:32:08,073 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2811 transitions. Word has length 106 [2023-11-29 04:32:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:32:08,074 INFO L495 AbstractCegarLoop]: Abstraction has 2116 states and 2811 transitions. [2023-11-29 04:32:08,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 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-11-29 04:32:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2811 transitions. [2023-11-29 04:32:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 04:32:08,075 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:08,075 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:32:08,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-11-29 04:32:08,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-11-29 04:32:08,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:32:08,476 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:32:08,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash -822164494, now seen corresponding path program 1 times [2023-11-29 04:32:08,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:32:08,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004448539] [2023-11-29 04:32:08,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:08,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-11-29 04:32:08,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:32:08,478 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:32:08,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:32:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:09,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 04:32:09,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:32:09,354 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-11-29 04:32:09,461 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:32:09,461 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-11-29 04:32:09,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:32:09,498 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-11-29 04:32:09,506 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-11-29 04:32:09,602 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-11-29 04:32:09,608 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-11-29 04:32:10,330 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:32:10,330 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-11-29 04:32:10,339 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-11-29 04:32:10,446 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:32:10,446 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-11-29 04:32:10,457 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-11-29 04:32:10,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 04:32:10,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 04:32:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:32:10,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:32:10,657 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4466 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:32:10,693 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4466 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_4466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 04:32:12,120 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4466 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4557))) (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$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4558) .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4558) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4557) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 04:32:12,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:32:12,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004448539] [2023-11-29 04:32:12,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004448539] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:32:12,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [296779150] [2023-11-29 04:32:12,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:12,129 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:32:12,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:32:12,130 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:32:12,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-11-29 04:33:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:59,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 04:33:59,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:33:59,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:33:59,631 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-11-29 04:33:59,650 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:33:59,650 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-11-29 04:33:59,707 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-11-29 04:33:59,714 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-11-29 04:33:59,879 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-11-29 04:33:59,884 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-11-29 04:34:00,601 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:34:00,601 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-11-29 04:34:00,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-11-29 04:34:00,786 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:34:00,786 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-11-29 04:34:00,796 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-11-29 04:34:00,810 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-11-29 04:34:00,817 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-11-29 04:34:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:34:00,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:34:00,883 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5010) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-11-29 04:34:00,921 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_5010) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:34:02,409 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5103) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5102) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5102))) (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$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5103) .cse2 v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5010) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 04:34:02,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [296779150] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:34:02,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:34:02,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 04:34:02,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107560082] [2023-11-29 04:34:02,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:34:02,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:34:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:34:02,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:34:02,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 04:34:02,421 INFO L87 Difference]: Start difference. First operand 2116 states and 2811 transitions. Second operand has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:34:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:34:28,490 INFO L93 Difference]: Finished difference Result 2469 states and 3131 transitions. [2023-11-29 04:34:28,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:34:28,491 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2023-11-29 04:34:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:34:28,496 INFO L225 Difference]: With dead ends: 2469 [2023-11-29 04:34:28,496 INFO L226 Difference]: Without dead ends: 2469 [2023-11-29 04:34:28,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 04:34:28,497 INFO L413 NwaCegarLoop]: 775 mSDtfsCounter, 1109 mSDsluCounter, 4473 mSDsCounter, 0 mSdLazyCounter, 11196 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 5248 SdHoareTripleChecker+Invalid, 11215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 11196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:34:28,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 5248 Invalid, 11215 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 11196 Invalid, 0 Unknown, 0 Unchecked, 25.7s Time] [2023-11-29 04:34:28,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2023-11-29 04:34:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2115. [2023-11-29 04:34:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2115 states, 1502 states have (on average 1.8462050599201065) internal successors, (2773), 2095 states have internal predecessors, (2773), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 04:34:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2808 transitions. [2023-11-29 04:34:28,539 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2808 transitions. Word has length 106 [2023-11-29 04:34:28,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:34:28,539 INFO L495 AbstractCegarLoop]: Abstraction has 2115 states and 2808 transitions. [2023-11-29 04:34:28,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:34:28,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2808 transitions. [2023-11-29 04:34:28,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 04:34:28,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:34:28,541 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:34:28,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-11-29 04:34:28,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-11-29 04:34:28,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:34:28,941 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:34:28,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:34:28,942 INFO L85 PathProgramCache]: Analyzing trace with hash 175966541, now seen corresponding path program 1 times [2023-11-29 04:34:28,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:34:28,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647720043] [2023-11-29 04:34:28,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:34:28,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:34:28,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:34:28,943 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:34:28,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Waiting until timeout for monitored process [2023-11-29 04:34:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:34:29,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 04:34:29,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:34:29,890 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-11-29 04:34:30,024 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:34:30,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-11-29 04:34:30,066 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-11-29 04:34:30,172 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-11-29 04:34:31,086 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:34:31,086 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-11-29 04:34:31,211 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:34:31,211 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-11-29 04:34:31,311 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:34:31,311 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-11-29 04:34:31,334 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-11-29 04:34:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:34:31,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:34:31,475 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5525) |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-11-29 04:34:31,487 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5525) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:34:31,503 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5525 (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$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5524))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5525)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:34:31,519 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5525 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5524))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5525)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:34:31,966 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5571 (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$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5571))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5524)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5525)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:34:31,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:34:31,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647720043] [2023-11-29 04:34:31,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647720043] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:34:31,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1130995664] [2023-11-29 04:34:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:34:31,971 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:34:31,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:34:31,972 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:34:31,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-11-29 04:35:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:01,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 04:35:01,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:35:01,119 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:35:01,120 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-11-29 04:35:01,641 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 04:35:01,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 04:35:01,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:35:02,469 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:35:02,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 04:35:02,666 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:35:02,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 04:35:02,796 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:35:02,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 04:35:02,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 04:35:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:35:02,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:35:02,895 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5992) |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-11-29 04:35:02,909 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5992 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5992) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:35:02,925 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5992 (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$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5991))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5992)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:35:02,942 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5992 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5991))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5992)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:35:03,414 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2023-11-29 04:35:03,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2023-11-29 04:35:03,426 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6038))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5991)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5992)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 04:35:03,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1130995664] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:35:03,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:35:03,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 22 [2023-11-29 04:35:03,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456172010] [2023-11-29 04:35:03,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:35:03,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 04:35:03,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:35:03,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 04:35:03,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=534, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 04:35:03,431 INFO L87 Difference]: Start difference. First operand 2115 states and 2808 transitions. Second operand has 23 states, 20 states have (on average 6.4) internal successors, (128), 22 states have internal predecessors, (128), 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-11-29 04:35:40,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:35:40,100 INFO L93 Difference]: Finished difference Result 2967 states and 3434 transitions. [2023-11-29 04:35:40,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 04:35:40,100 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.4) internal successors, (128), 22 states have internal predecessors, (128), 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 108 [2023-11-29 04:35:40,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:35:40,105 INFO L225 Difference]: With dead ends: 2967 [2023-11-29 04:35:40,105 INFO L226 Difference]: Without dead ends: 2967 [2023-11-29 04:35:40,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=229, Invalid=1361, Unknown=10, NotChecked=850, Total=2450 [2023-11-29 04:35:40,106 INFO L413 NwaCegarLoop]: 1007 mSDtfsCounter, 1882 mSDsluCounter, 11856 mSDsCounter, 0 mSdLazyCounter, 15836 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 12863 SdHoareTripleChecker+Invalid, 15879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 15836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:35:40,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 12863 Invalid, 15879 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 15836 Invalid, 0 Unknown, 0 Unchecked, 35.6s Time] [2023-11-29 04:35:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2023-11-29 04:35:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2114. [2023-11-29 04:35:40,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 1502 states have (on average 1.8442077230359522) internal successors, (2770), 2094 states have internal predecessors, (2770), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 04:35:40,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2805 transitions. [2023-11-29 04:35:40,135 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2805 transitions. Word has length 108 [2023-11-29 04:35:40,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:35:40,135 INFO L495 AbstractCegarLoop]: Abstraction has 2114 states and 2805 transitions. [2023-11-29 04:35:40,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.4) internal successors, (128), 22 states have internal predecessors, (128), 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-11-29 04:35:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2805 transitions. [2023-11-29 04:35:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 04:35:40,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:35:40,136 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:35:40,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2023-11-29 04:35:40,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 04:35:40,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:35:40,537 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:35:40,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:35:40,537 INFO L85 PathProgramCache]: Analyzing trace with hash 175966542, now seen corresponding path program 1 times [2023-11-29 04:35:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:35:40,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098917896] [2023-11-29 04:35:40,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:35:40,539 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-11-29 04:35:40,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:35:40,540 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:35:40,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-11-29 04:35:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:41,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 04:35:41,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:35:41,507 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-11-29 04:35:41,619 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:35:41,620 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-11-29 04:35:41,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:35:41,648 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-11-29 04:35:41,653 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-11-29 04:35:41,761 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-11-29 04:35:41,765 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-11-29 04:35:42,470 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:35:42,471 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-11-29 04:35:42,485 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-11-29 04:35:42,607 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:35:42,607 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-11-29 04:35:42,619 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-11-29 04:35:42,711 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:35:42,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 04:35:42,716 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-11-29 04:35:42,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 04:35:42,739 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-11-29 04:35:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:35:42,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:35:42,926 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 04:35:42,958 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 04:35:42,999 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6506) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6505) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6505))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6506) .cse2 v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 04:35:43,052 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6506) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6505) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6505))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6506) .cse3 v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 04:35:44,328 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6600 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6600))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6505))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6599) .cse0 v_ArrVal_6506) .cse1 v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6600 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6600))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6599) .cse6 v_ArrVal_6506) (select (select (store .cse7 .cse6 v_ArrVal_6505) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6507))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 04:35:44,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:35:44,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098917896] [2023-11-29 04:35:44,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098917896] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:35:44,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [913361761] [2023-11-29 04:35:44,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:35:44,342 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:35:44,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:35:44,343 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:35:44,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-11-29 04:36:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:36:14,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 04:36:14,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:36:14,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:36:14,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:36:14,906 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:36:14,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:36:14,961 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-11-29 04:36:14,974 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-11-29 04:36:15,137 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-11-29 04:36:15,142 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-11-29 04:36:15,795 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:36:15,795 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-11-29 04:36:15,803 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-11-29 04:36:15,969 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:36:15,970 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-11-29 04:36:15,977 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-11-29 04:36:16,083 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:36:16,083 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-11-29 04:36:16,092 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-11-29 04:36:16,109 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-11-29 04:36:16,114 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-11-29 04:36:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:36:16,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:36:16,176 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2023-11-29 04:36:16,213 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2023-11-29 04:36:16,288 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7067))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7068) .cse0 v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7068) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 04:36:16,373 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7068) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7067))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7068) .cse3 v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 04:36:18,550 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7161))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7162) .cse1 v_ArrVal_7068) (select (select (store .cse2 .cse1 v_ArrVal_7067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7070))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7161))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7067))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7162) .cse4 v_ArrVal_7068) .cse5 v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 04:36:18,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [913361761] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:36:18,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:36:18,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 04:36:18,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493276493] [2023-11-29 04:36:18,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:36:18,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 04:36:18,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:36:18,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 04:36:18,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 04:36:18,571 INFO L87 Difference]: Start difference. First operand 2114 states and 2805 transitions. Second operand has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:36:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:36:47,481 INFO L93 Difference]: Finished difference Result 2467 states and 3125 transitions. [2023-11-29 04:36:47,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:36:47,482 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 04:36:47,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:36:47,485 INFO L225 Difference]: With dead ends: 2467 [2023-11-29 04:36:47,485 INFO L226 Difference]: Without dead ends: 2467 [2023-11-29 04:36:47,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 04:36:47,486 INFO L413 NwaCegarLoop]: 824 mSDtfsCounter, 1586 mSDsluCounter, 2819 mSDsCounter, 0 mSdLazyCounter, 7740 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 3643 SdHoareTripleChecker+Invalid, 7768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 7740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:36:47,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 3643 Invalid, 7768 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 7740 Invalid, 0 Unknown, 0 Unchecked, 28.3s Time] [2023-11-29 04:36:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2023-11-29 04:36:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2113. [2023-11-29 04:36:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1502 states have (on average 1.8422103861517976) internal successors, (2767), 2093 states have internal predecessors, (2767), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 04:36:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2802 transitions. [2023-11-29 04:36:47,510 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2802 transitions. Word has length 108 [2023-11-29 04:36:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:36:47,510 INFO L495 AbstractCegarLoop]: Abstraction has 2113 states and 2802 transitions. [2023-11-29 04:36:47,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:36:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2802 transitions. [2023-11-29 04:36:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 04:36:47,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:36:47,511 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:36:47,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-11-29 04:36:47,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-11-29 04:36:47,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:36:47,912 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:36:47,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:36:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1602180548, now seen corresponding path program 1 times [2023-11-29 04:36:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:36:47,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250859504] [2023-11-29 04:36:47,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:36:47,913 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-11-29 04:36:47,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:36:47,914 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:36:47,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:36:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:36:49,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 04:36:49,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:36:49,204 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-11-29 04:36:49,454 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:36:49,454 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-11-29 04:36:49,501 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-11-29 04:36:49,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 24 treesize of output 12 [2023-11-29 04:36:51,115 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:36:51,115 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-11-29 04:36:51,300 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:36:51,300 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-11-29 04:36:51,476 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:36:51,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:36:51,635 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:36:51,636 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-11-29 04:36:51,656 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-11-29 04:36:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:36:51,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:36:51,834 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7600) |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-11-29 04:36:51,852 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7600) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:36:51,873 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (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$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:36:51,894 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:36:51,919 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7598))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:36:51,945 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7598))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:36:52,493 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7646))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7598)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:36:52,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:36:52,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250859504] [2023-11-29 04:36:52,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250859504] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:36:52,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1533198604] [2023-11-29 04:36:52,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:36:52,500 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:36:52,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:36:52,501 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:36:52,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-11-29 04:37:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:37:31,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 04:37:31,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:37:31,662 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:37:31,662 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-11-29 04:37:32,454 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 04:37:32,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 04:37:32,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:37:33,725 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:37:33,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 04:37:34,039 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:37:34,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 04:37:34,239 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:37:34,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 04:37:34,440 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:37:34,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 04:37:34,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 04:37:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:37:34,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:37:42,969 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (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$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8082))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:37:43,001 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8082))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 04:37:43,026 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (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$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8081))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8082)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:37:43,053 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8081))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8082)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:37:43,677 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-11-29 04:37:43,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 108 [2023-11-29 04:37:43,699 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8129))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8081)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8082)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 04:37:43,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1533198604] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:37:43,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:37:43,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 24 [2023-11-29 04:37:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948824624] [2023-11-29 04:37:43,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:37:43,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 04:37:43,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:37:43,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 04:37:43,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=713, Unknown=22, NotChecked=780, Total=1640 [2023-11-29 04:37:43,707 INFO L87 Difference]: Start difference. First operand 2113 states and 2802 transitions. Second operand has 25 states, 22 states have (on average 6.0) internal successors, (132), 24 states have internal predecessors, (132), 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-11-29 04:38:45,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:38:45,210 INFO L93 Difference]: Finished difference Result 2963 states and 3428 transitions. [2023-11-29 04:38:45,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 04:38:45,211 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.0) internal successors, (132), 24 states have internal predecessors, (132), 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 110 [2023-11-29 04:38:45,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:38:45,215 INFO L225 Difference]: With dead ends: 2963 [2023-11-29 04:38:45,215 INFO L226 Difference]: Without dead ends: 2963 [2023-11-29 04:38:45,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=279, Invalid=1727, Unknown=22, NotChecked=1164, Total=3192 [2023-11-29 04:38:45,217 INFO L413 NwaCegarLoop]: 1006 mSDtfsCounter, 1870 mSDsluCounter, 13587 mSDsCounter, 0 mSdLazyCounter, 18278 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 14593 SdHoareTripleChecker+Invalid, 18319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 18278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:38:45,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1884 Valid, 14593 Invalid, 18319 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [41 Valid, 18278 Invalid, 0 Unknown, 0 Unchecked, 59.7s Time] [2023-11-29 04:38:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2023-11-29 04:38:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2112. [2023-11-29 04:38:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 1502 states have (on average 1.8402130492676432) internal successors, (2764), 2092 states have internal predecessors, (2764), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 04:38:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2799 transitions. [2023-11-29 04:38:45,251 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2799 transitions. Word has length 110 [2023-11-29 04:38:45,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:38:45,252 INFO L495 AbstractCegarLoop]: Abstraction has 2112 states and 2799 transitions. [2023-11-29 04:38:45,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.0) internal successors, (132), 24 states have internal predecessors, (132), 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-11-29 04:38:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2799 transitions. [2023-11-29 04:38:45,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 04:38:45,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:38:45,253 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:38:45,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-11-29 04:38:45,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2023-11-29 04:38:45,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:38:45,654 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 04:38:45,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:45,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1602180549, now seen corresponding path program 1 times [2023-11-29 04:38:45,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:38:45,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185633057] [2023-11-29 04:38:45,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:45,655 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-11-29 04:38:45,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:38:45,656 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-11-29 04:38:45,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Waiting until timeout for monitored process [2023-11-29 04:38:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:47,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 04:38:47,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:38:47,099 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-11-29 04:38:47,574 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-11-29 04:38:47,608 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:38:47,609 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-11-29 04:38:47,659 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-11-29 04:38:47,675 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-11-29 04:38:47,845 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-11-29 04:38:47,852 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-11-29 04:38:48,991 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:38:48,992 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-11-29 04:38:49,005 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-11-29 04:38:49,200 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:38:49,200 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-11-29 04:38:49,212 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-11-29 04:38:49,355 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:38:49,355 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-11-29 04:38:49,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:38:49,509 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:38:49,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:38:49,522 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-11-29 04:38:49,548 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-11-29 04:38:49,559 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-11-29 04:38:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:38:49,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:38:49,852 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:38:49,895 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 04:38:49,973 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8613))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8614) .cse0 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8614) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8613) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 04:38:50,146 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8614) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8613) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8613))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8614) .cse3 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 04:38:51,124 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8611))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8612) .cse1 v_ArrVal_8614) (select (select (store .cse2 .cse1 v_ArrVal_8613) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8615))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8611))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8613))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8612) .cse4 v_ArrVal_8614) .cse5 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 04:38:52,683 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8611))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8612) .cse2 v_ArrVal_8614) (select (select (store .cse3 .cse2 v_ArrVal_8613) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8615))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8611))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_8613))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8612) .cse5 v_ArrVal_8614) .cse6 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 04:38:58,976 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8707))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8611))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8613))) (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$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8708) .cse0 v_ArrVal_8612) .cse1 v_ArrVal_8614) .cse2 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_8708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8707))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8611))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8708) .cse8 v_ArrVal_8612) .cse9 v_ArrVal_8614) (select (select (store .cse10 .cse9 v_ArrVal_8613) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8615))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 04:38:59,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:38:59,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185633057] [2023-11-29 04:38:59,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185633057] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:38:59,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [185505846] [2023-11-29 04:38:59,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:59,035 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:38:59,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:38:59,036 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:38:59,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e44fd50-a074-40df-b011-e61f292f5452/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2023-11-29 04:39:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:41,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 04:39:41,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:39:41,994 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-11-29 04:39:44,531 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:39:44,532 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-11-29 04:39:44,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:39:44,780 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-11-29 04:39:44,810 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-11-29 04:39:45,291 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-11-29 04:39:45,320 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-11-29 04:39:50,630 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:39:50,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:39:50,715 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-11-29 04:39:51,281 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:39:51,281 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-11-29 04:39:51,338 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-11-29 04:39:51,725 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:39:51,726 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-11-29 04:39:51,786 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-11-29 04:39:52,191 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:39:52,191 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-11-29 04:39:52,248 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-11-29 04:39:52,330 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-11-29 04:39:52,380 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-11-29 04:39:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:39:52,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:39:52,639 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 04:39:52,773 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 04:39:52,933 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9193))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9192) .cse0 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9192) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9193) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 04:39:53,136 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9192) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9193) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9193))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9192) .cse3 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 04:39:53,555 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9190))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9193))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9191) .cse0 v_ArrVal_9192) .cse1 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9190))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9191) .cse6 v_ArrVal_9192) (select (select (store .cse7 .cse6 v_ArrVal_9193) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9194))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 04:39:56,190 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9190))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9191) .cse2 v_ArrVal_9192) (select (select (store .cse3 .cse2 v_ArrVal_9193) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9194))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9190))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9193))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9191) .cse5 v_ArrVal_9192) .cse6 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 04:40:04,558 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9286))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9190))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9193))) (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$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9287) .cse0 v_ArrVal_9191) .cse1 v_ArrVal_9192) .cse2 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9286))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9190))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9287) .cse8 v_ArrVal_9191) .cse9 v_ArrVal_9192) (select (select (store .cse10 .cse9 v_ArrVal_9193) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9194))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 04:40:04,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [185505846] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:40:04,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:40:04,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-11-29 04:40:04,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682366704] [2023-11-29 04:40:04,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:40:04,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:40:04,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:40:04,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:40:04,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=160, Unknown=14, NotChecked=518, Total=756 [2023-11-29 04:40:04,594 INFO L87 Difference]: Start difference. First operand 2112 states and 2799 transitions. Second operand has 12 states, 10 states have (on average 6.6) internal successors, (66), 12 states have internal predecessors, (66), 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)