./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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_fb8e8b80-4b46-445e-884f-65c978f45391/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 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:57:58,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:57:58,336 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:57:58,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:57:58,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:57:58,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:57:58,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:57:58,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:57:58,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:57:58,370 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:57:58,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:57:58,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:57:58,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:57:58,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:57:58,373 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:57:58,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:57:58,374 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:57:58,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:57:58,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:57:58,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:57:58,376 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:57:58,377 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:57:58,377 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:57:58,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:57:58,378 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:57:58,379 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:57:58,379 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:57:58,380 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:57:58,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:57:58,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:57:58,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:57:58,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:57:58,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:57:58,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:57:58,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:57:58,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:57:58,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:57:58,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:57:58,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:57:58,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:57:58,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:57:58,384 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_fb8e8b80-4b46-445e-884f-65c978f45391/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_fb8e8b80-4b46-445e-884f-65c978f45391/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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2023-11-29 04:57:58,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:57:58,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:57:58,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:57:58,674 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:57:58,674 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:57:58,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i [2023-11-29 04:58:01,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:58:02,073 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:58:02,074 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i [2023-11-29 04:58:02,094 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/data/e6358cd40/11c5413a36c9417c98ef2e1e1fd69bb5/FLAG1b2e3194c [2023-11-29 04:58:02,111 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/data/e6358cd40/11c5413a36c9417c98ef2e1e1fd69bb5 [2023-11-29 04:58:02,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:58:02,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:58:02,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:58:02,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:58:02,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:58:02,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:58:02" (1/1) ... [2023-11-29 04:58:02,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@646a9e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:02, skipping insertion in model container [2023-11-29 04:58:02,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:58:02" (1/1) ... [2023-11-29 04:58:02,227 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:58:02,793 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:58:02,806 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:58:02,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@45aa0953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:02, skipping insertion in model container [2023-11-29 04:58:02,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:58:02,808 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 04:58:02,810 INFO L158 Benchmark]: Toolchain (without parser) took 693.16ms. Allocated memory is still 140.5MB. Free memory was 95.9MB in the beginning and 76.0MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 04:58:02,811 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 140.5MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:58:02,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 690.24ms. Allocated memory is still 140.5MB. Free memory was 95.9MB in the beginning and 76.0MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 04:58:02,813 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.20ms. Allocated memory is still 140.5MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 690.24ms. Allocated memory is still 140.5MB. Free memory was 95.9MB in the beginning and 76.0MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 739]: 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_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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_fb8e8b80-4b46-445e-884f-65c978f45391/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 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:58:04,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:58:04,861 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 04:58:04,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:58:04,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:58:04,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:58:04,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:58:04,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:58:04,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:58:04,910 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:58:04,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:58:04,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:58:04,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:58:04,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:58:04,913 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:58:04,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:58:04,915 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:58:04,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:58:04,916 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:58:04,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:58:04,917 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:58:04,917 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:58:04,918 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:58:04,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:58:04,919 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:58:04,919 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:58:04,923 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:58:04,923 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:58:04,924 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:58:04,924 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:58:04,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:58:04,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:58:04,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:58:04,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:58:04,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:58:04,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:58:04,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:58:04,927 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:58:04,927 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:58:04,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:58:04,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:58:04,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:58:04,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:58:04,928 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:58:04,928 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_fb8e8b80-4b46-445e-884f-65c978f45391/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_fb8e8b80-4b46-445e-884f-65c978f45391/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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2023-11-29 04:58:05,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:58:05,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:58:05,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:58:05,273 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:58:05,273 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:58:05,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i [2023-11-29 04:58:08,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:58:08,557 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:58:08,558 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i [2023-11-29 04:58:08,580 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/data/041c7ea6e/5d9374e0ea6b4800bf33e4ebac64bcab/FLAG0569450f6 [2023-11-29 04:58:08,598 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/data/041c7ea6e/5d9374e0ea6b4800bf33e4ebac64bcab [2023-11-29 04:58:08,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:58:08,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:58:08,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:58:08,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:58:08,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:58:08,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:58:08" (1/1) ... [2023-11-29 04:58:08,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b346c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:08, skipping insertion in model container [2023-11-29 04:58:08,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:58:08" (1/1) ... [2023-11-29 04:58:08,689 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:58:09,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:58:09,326 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 04:58:09,345 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:58:09,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:58:09,437 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:58:09,524 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:58:09,582 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:58:09,590 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:58:09,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:09 WrapperNode [2023-11-29 04:58:09,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:58:09,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:58:09,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:58:09,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:58:09,600 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:58:09" (1/1) ... [2023-11-29 04:58:09,634 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:58:09" (1/1) ... [2023-11-29 04:58:09,688 INFO L138 Inliner]: procedures = 180, calls = 282, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1031 [2023-11-29 04:58:09,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:58:09,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:58:09,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:58:09,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:58:09,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:09" (1/1) ... [2023-11-29 04:58:09,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:09" (1/1) ... [2023-11-29 04:58:09,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:09" (1/1) ... [2023-11-29 04:58:09,797 INFO L175 MemorySlicer]: Split 259 memory accesses to 4 slices as follows [2, 5, 34, 218]. 84 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 1, 4, 50]. [2023-11-29 04:58:09,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:09" (1/1) ... [2023-11-29 04:58:09,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:09" (1/1) ... [2023-11-29 04:58:09,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:09" (1/1) ... [2023-11-29 04:58:09,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:09" (1/1) ... [2023-11-29 04:58:09,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:09" (1/1) ... [2023-11-29 04:58:09,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:09" (1/1) ... [2023-11-29 04:58:09,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:58:09,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:58:09,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:58:09,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:58:09,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:09" (1/1) ... [2023-11-29 04:58:09,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:58:09,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:58:09,903 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:09,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:09,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 04:58:09,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 04:58:09,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 04:58:09,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 04:58:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 04:58:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 04:58:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 04:58:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 04:58:09,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 04:58:09,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 04:58:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 04:58:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 04:58:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 04:58:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 04:58:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 04:58:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 04:58:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 04:58:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 04:58:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:58:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:58:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:58:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:58:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:58:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 04:58:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:58:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 04:58:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:58:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:58:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:58:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 04:58:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:58:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:58:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:58:09,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 04:58:09,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:58:09,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:58:09,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:58:09,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:58:09,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 04:58:09,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:58:09,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:58:10,202 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:58:10,205 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:58:10,210 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:58:10,270 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:58:10,294 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:58:10,320 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:58:15,242 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:58:15,420 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:58:15,421 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-11-29 04:58:15,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:58:15 BoogieIcfgContainer [2023-11-29 04:58:15,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:58:15,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:58:15,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:58:15,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:58:15,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:58:08" (1/3) ... [2023-11-29 04:58:15,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612a6b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:58:15, skipping insertion in model container [2023-11-29 04:58:15,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:58:09" (2/3) ... [2023-11-29 04:58:15,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612a6b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:58:15, skipping insertion in model container [2023-11-29 04:58:15,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:58:15" (3/3) ... [2023-11-29 04:58:15,431 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test3-1.i [2023-11-29 04:58:15,451 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:58:15,452 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 531 error locations. [2023-11-29 04:58:15,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:58:15,530 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;@5d8ea936, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:58:15,531 INFO L358 AbstractCegarLoop]: Starting to check reachability of 531 error locations. [2023-11-29 04:58:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 964 states, 428 states have (on average 2.5257009345794392) internal successors, (1081), 957 states have internal predecessors, (1081), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:58:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 04:58:15,545 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:15,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 04:58:15,546 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr529ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:15,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:15,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1685664, now seen corresponding path program 1 times [2023-11-29 04:58:15,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:15,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43497364] [2023-11-29 04:58:15,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:15,569 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:58:15,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:15,593 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:15,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:15,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:58:15,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:15,940 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_53| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_53| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_53|)))) is different from true [2023-11-29 04:58:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:58:15,943 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:15,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:15,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43497364] [2023-11-29 04:58:15,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43497364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:15,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:15,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:58:15,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859439937] [2023-11-29 04:58:15,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:15,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:58:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:16,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:58:16,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-11-29 04:58:16,007 INFO L87 Difference]: Start difference. First operand has 964 states, 428 states have (on average 2.5257009345794392) internal successors, (1081), 957 states have internal predecessors, (1081), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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:58:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:19,244 INFO L93 Difference]: Finished difference Result 1319 states and 1410 transitions. [2023-11-29 04:58:19,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:58:19,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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:58:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:19,268 INFO L225 Difference]: With dead ends: 1319 [2023-11-29 04:58:19,269 INFO L226 Difference]: Without dead ends: 1317 [2023-11-29 04:58:19,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-11-29 04:58:19,273 INFO L413 NwaCegarLoop]: 759 mSDtfsCounter, 393 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1411 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:19,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1228 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 807 Invalid, 0 Unknown, 1411 Unchecked, 3.1s Time] [2023-11-29 04:58:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2023-11-29 04:58:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 953. [2023-11-29 04:58:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 423 states have (on average 2.3640661938534278) internal successors, (1000), 946 states have internal predecessors, (1000), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:58:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1010 transitions. [2023-11-29 04:58:19,386 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1010 transitions. Word has length 3 [2023-11-29 04:58:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:19,386 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1010 transitions. [2023-11-29 04:58:19,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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:58:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1010 transitions. [2023-11-29 04:58:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 04:58:19,387 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:19,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 04:58:19,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:19,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:19,588 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:19,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1684089, now seen corresponding path program 1 times [2023-11-29 04:58:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:19,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830058696] [2023-11-29 04:58:19,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:19,590 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:58:19,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:19,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:19,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:19,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:58:19,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:19,713 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:58:19,725 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:58:19,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:19,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:19,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830058696] [2023-11-29 04:58:19,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830058696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:19,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:19,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:58:19,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058221350] [2023-11-29 04:58:19,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:19,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:58:19,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:19,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:58:19,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:58:19,729 INFO L87 Difference]: Start difference. First operand 953 states and 1010 transitions. 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:58:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:21,662 INFO L93 Difference]: Finished difference Result 963 states and 1020 transitions. [2023-11-29 04:58:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:58:21,663 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:58:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:21,668 INFO L225 Difference]: With dead ends: 963 [2023-11-29 04:58:21,669 INFO L226 Difference]: Without dead ends: 963 [2023-11-29 04:58:21,669 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:58:21,670 INFO L413 NwaCegarLoop]: 525 mSDtfsCounter, 889 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:21,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 576 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 04:58:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2023-11-29 04:58:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 953. [2023-11-29 04:58:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 432 states have (on average 2.3194444444444446) internal successors, (1002), 945 states have internal predecessors, (1002), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:58:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1012 transitions. [2023-11-29 04:58:21,693 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1012 transitions. Word has length 3 [2023-11-29 04:58:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:21,694 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1012 transitions. [2023-11-29 04:58:21,694 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:58:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1012 transitions. [2023-11-29 04:58:21,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 04:58:21,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:21,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 04:58:21,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:21,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:21,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:21,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:21,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1684090, now seen corresponding path program 1 times [2023-11-29 04:58:21,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:21,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270573421] [2023-11-29 04:58:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:21,897 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:58:21,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:21,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:21,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:22,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:58:22,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:22,016 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:58:22,039 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:58:22,039 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:22,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:22,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270573421] [2023-11-29 04:58:22,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270573421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:22,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:22,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:58:22,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114903210] [2023-11-29 04:58:22,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:22,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:58:22,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:22,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:58:22,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:58:22,042 INFO L87 Difference]: Start difference. First operand 953 states and 1012 transitions. 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:58:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:25,726 INFO L93 Difference]: Finished difference Result 1317 states and 1409 transitions. [2023-11-29 04:58:25,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:58:25,727 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:58:25,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:25,735 INFO L225 Difference]: With dead ends: 1317 [2023-11-29 04:58:25,735 INFO L226 Difference]: Without dead ends: 1317 [2023-11-29 04:58:25,736 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:58:25,737 INFO L413 NwaCegarLoop]: 749 mSDtfsCounter, 392 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:25,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1228 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-29 04:58:25,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2023-11-29 04:58:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1124. [2023-11-29 04:58:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 603 states have (on average 2.295190713101161) internal successors, (1384), 1115 states have internal predecessors, (1384), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:58:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1396 transitions. [2023-11-29 04:58:25,782 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1396 transitions. Word has length 3 [2023-11-29 04:58:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:25,782 INFO L495 AbstractCegarLoop]: Abstraction has 1124 states and 1396 transitions. [2023-11-29 04:58:25,783 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:58:25,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1396 transitions. [2023-11-29 04:58:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:58:25,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:25,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:25,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:25,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:25,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:25,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:25,986 INFO L85 PathProgramCache]: Analyzing trace with hash 514019011, now seen corresponding path program 1 times [2023-11-29 04:58:25,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:25,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322469021] [2023-11-29 04:58:25,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:25,987 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:58:25,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:25,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:25,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:26,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:58:26,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:26,157 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:58:26,166 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:58:26,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:58:26,262 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:58:26,287 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:58:26,287 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:58:26,314 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:58:26,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:26,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:26,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322469021] [2023-11-29 04:58:26,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322469021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:26,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:26,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:58:26,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709598848] [2023-11-29 04:58:26,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:26,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:58:26,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:26,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:58:26,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:58:26,318 INFO L87 Difference]: Start difference. First operand 1124 states and 1396 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:29,429 INFO L93 Difference]: Finished difference Result 1127 states and 1400 transitions. [2023-11-29 04:58:29,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:58:29,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 04:58:29,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:29,435 INFO L225 Difference]: With dead ends: 1127 [2023-11-29 04:58:29,436 INFO L226 Difference]: Without dead ends: 1127 [2023-11-29 04:58:29,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:58:29,437 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 973 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:29,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 298 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 04:58:29,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2023-11-29 04:58:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 942. [2023-11-29 04:58:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 432 states have (on average 2.2893518518518516) internal successors, (989), 934 states have internal predecessors, (989), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:58:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 999 transitions. [2023-11-29 04:58:29,462 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 999 transitions. Word has length 7 [2023-11-29 04:58:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:29,462 INFO L495 AbstractCegarLoop]: Abstraction has 942 states and 999 transitions. [2023-11-29 04:58:29,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 999 transitions. [2023-11-29 04:58:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 04:58:29,463 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:29,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:29,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:58:29,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:29,667 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:29,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:29,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1245279837, now seen corresponding path program 1 times [2023-11-29 04:58:29,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:29,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283715831] [2023-11-29 04:58:29,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:29,668 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:58:29,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:29,669 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:29,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:29,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:58:29,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:29,815 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:58:29,829 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:58:29,829 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:29,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:29,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283715831] [2023-11-29 04:58:29,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283715831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:29,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:29,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:58:29,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234534904] [2023-11-29 04:58:29,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:29,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:58:29,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:29,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:58:29,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:58:29,831 INFO L87 Difference]: Start difference. First operand 942 states and 999 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:58:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:32,242 INFO L93 Difference]: Finished difference Result 1239 states and 1327 transitions. [2023-11-29 04:58:32,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:58:32,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:58:32,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:32,251 INFO L225 Difference]: With dead ends: 1239 [2023-11-29 04:58:32,251 INFO L226 Difference]: Without dead ends: 1239 [2023-11-29 04:58:32,251 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:58:32,252 INFO L413 NwaCegarLoop]: 774 mSDtfsCounter, 885 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:32,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 989 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 04:58:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2023-11-29 04:58:32,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 894. [2023-11-29 04:58:32,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 432 states have (on average 2.178240740740741) internal successors, (941), 886 states have internal predecessors, (941), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:58:32,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 951 transitions. [2023-11-29 04:58:32,274 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 951 transitions. Word has length 8 [2023-11-29 04:58:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:32,274 INFO L495 AbstractCegarLoop]: Abstraction has 894 states and 951 transitions. [2023-11-29 04:58:32,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:58:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 951 transitions. [2023-11-29 04:58:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 04:58:32,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:32,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:32,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Ended with exit code 0 [2023-11-29 04:58:32,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:32,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:32,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1245279836, now seen corresponding path program 1 times [2023-11-29 04:58:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:32,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790816688] [2023-11-29 04:58:32,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:32,479 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:58:32,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:32,480 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:32,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:32,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:58:32,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:32,604 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:58:32,631 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:58:32,632 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:32,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:32,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790816688] [2023-11-29 04:58:32,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790816688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:32,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:32,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:58:32,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53485527] [2023-11-29 04:58:32,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:32,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:58:32,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:32,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:58:32,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:58:32,634 INFO L87 Difference]: Start difference. First operand 894 states and 951 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:58:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:36,154 INFO L93 Difference]: Finished difference Result 1308 states and 1399 transitions. [2023-11-29 04:58:36,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:58:36,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:58:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:36,162 INFO L225 Difference]: With dead ends: 1308 [2023-11-29 04:58:36,162 INFO L226 Difference]: Without dead ends: 1308 [2023-11-29 04:58:36,162 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:58:36,163 INFO L413 NwaCegarLoop]: 945 mSDtfsCounter, 613 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:36,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1293 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-29 04:58:36,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2023-11-29 04:58:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 907. [2023-11-29 04:58:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 455 states have (on average 2.1714285714285713) internal successors, (988), 899 states have internal predecessors, (988), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:58:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 998 transitions. [2023-11-29 04:58:36,191 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 998 transitions. Word has length 8 [2023-11-29 04:58:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:36,191 INFO L495 AbstractCegarLoop]: Abstraction has 907 states and 998 transitions. [2023-11-29 04:58:36,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:58:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 998 transitions. [2023-11-29 04:58:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:58:36,192 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:36,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:36,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:36,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:36,394 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:36,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:36,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1058268812, now seen corresponding path program 1 times [2023-11-29 04:58:36,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:36,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780035564] [2023-11-29 04:58:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:36,395 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:58:36,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:36,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:36,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:36,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:58:36,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:36,598 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:58:36,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:36,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:36,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780035564] [2023-11-29 04:58:36,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780035564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:36,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:36,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:58:36,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762982972] [2023-11-29 04:58:36,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:36,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:58:36,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:36,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:58:36,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:58:36,601 INFO L87 Difference]: Start difference. First operand 907 states and 998 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:58:38,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:38,759 INFO L93 Difference]: Finished difference Result 1316 states and 1442 transitions. [2023-11-29 04:58:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:58:38,761 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:58:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:38,767 INFO L225 Difference]: With dead ends: 1316 [2023-11-29 04:58:38,767 INFO L226 Difference]: Without dead ends: 1316 [2023-11-29 04:58:38,767 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:58:38,768 INFO L413 NwaCegarLoop]: 877 mSDtfsCounter, 497 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:38,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 2361 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 04:58:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2023-11-29 04:58:38,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1109. [2023-11-29 04:58:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 656 states have (on average 2.1402439024390243) internal successors, (1404), 1100 states have internal predecessors, (1404), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:58:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1416 transitions. [2023-11-29 04:58:38,793 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1416 transitions. Word has length 11 [2023-11-29 04:58:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:38,793 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1416 transitions. [2023-11-29 04:58:38,794 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:58:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1416 transitions. [2023-11-29 04:58:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 04:58:38,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:38,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:38,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:38,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:38,995 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr529ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:38,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:38,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1553405064, now seen corresponding path program 1 times [2023-11-29 04:58:38,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:38,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423315953] [2023-11-29 04:58:38,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:38,996 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:58:38,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:38,997 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:38,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:39,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:58:39,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:39,270 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_54| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_54|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_54| (_ bv0 1)) |c_#valid|))) is different from true [2023-11-29 04:58:39,271 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:58:39,271 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:39,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:39,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423315953] [2023-11-29 04:58:39,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423315953] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:39,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:39,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:58:39,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252147758] [2023-11-29 04:58:39,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:39,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:58:39,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:39,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:58:39,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-11-29 04:58:39,273 INFO L87 Difference]: Start difference. First operand 1109 states and 1416 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:41,998 INFO L93 Difference]: Finished difference Result 1429 states and 1819 transitions. [2023-11-29 04:58:41,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:58:41,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 04:58:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:42,004 INFO L225 Difference]: With dead ends: 1429 [2023-11-29 04:58:42,004 INFO L226 Difference]: Without dead ends: 1425 [2023-11-29 04:58:42,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-11-29 04:58:42,005 INFO L413 NwaCegarLoop]: 718 mSDtfsCounter, 294 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1238 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:42,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1178 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 692 Invalid, 0 Unknown, 1238 Unchecked, 2.7s Time] [2023-11-29 04:58:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2023-11-29 04:58:42,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1178. [2023-11-29 04:58:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 724 states have (on average 2.1146408839779007) internal successors, (1531), 1168 states have internal predecessors, (1531), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:58:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1545 transitions. [2023-11-29 04:58:42,036 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1545 transitions. Word has length 12 [2023-11-29 04:58:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:42,036 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1545 transitions. [2023-11-29 04:58:42,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:42,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1545 transitions. [2023-11-29 04:58:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 04:58:42,037 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:42,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:42,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Ended with exit code 0 [2023-11-29 04:58:42,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:42,238 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:42,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:42,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1495978260, now seen corresponding path program 1 times [2023-11-29 04:58:42,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:42,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915432817] [2023-11-29 04:58:42,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:42,239 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:58:42,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:42,240 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:42,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:42,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:58:42,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:42,389 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:58:42,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:42,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:42,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915432817] [2023-11-29 04:58:42,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915432817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:42,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:42,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:58:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120633897] [2023-11-29 04:58:42,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:42,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:58:42,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:42,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:58:42,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:58:42,391 INFO L87 Difference]: Start difference. First operand 1178 states and 1545 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:58:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:43,269 INFO L93 Difference]: Finished difference Result 1109 states and 1425 transitions. [2023-11-29 04:58:43,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:58:43,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:58:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:43,276 INFO L225 Difference]: With dead ends: 1109 [2023-11-29 04:58:43,276 INFO L226 Difference]: Without dead ends: 1109 [2023-11-29 04:58:43,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:58:43,277 INFO L413 NwaCegarLoop]: 780 mSDtfsCounter, 70 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:43,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1511 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:58:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2023-11-29 04:58:43,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2023-11-29 04:58:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 679 states have (on average 2.078055964653903) internal successors, (1411), 1099 states have internal predecessors, (1411), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:58:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1425 transitions. [2023-11-29 04:58:43,306 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1425 transitions. Word has length 13 [2023-11-29 04:58:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:43,306 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1425 transitions. [2023-11-29 04:58:43,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:58:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1425 transitions. [2023-11-29 04:58:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 04:58:43,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:43,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:43,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:43,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:43,508 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr364REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:43,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:43,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1178962534, now seen corresponding path program 1 times [2023-11-29 04:58:43,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:43,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647118566] [2023-11-29 04:58:43,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:43,510 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:58:43,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:43,511 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:43,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:43,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:58:43,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:43,704 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:58:43,704 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:43,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:43,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647118566] [2023-11-29 04:58:43,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647118566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:43,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:43,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:58:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077722707] [2023-11-29 04:58:43,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:43,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:58:43,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:43,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:58:43,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:58:43,707 INFO L87 Difference]: Start difference. First operand 1109 states and 1425 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:44,815 INFO L93 Difference]: Finished difference Result 1095 states and 1362 transitions. [2023-11-29 04:58:44,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:58:44,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 04:58:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:44,821 INFO L225 Difference]: With dead ends: 1095 [2023-11-29 04:58:44,821 INFO L226 Difference]: Without dead ends: 1095 [2023-11-29 04:58:44,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:58:44,821 INFO L413 NwaCegarLoop]: 749 mSDtfsCounter, 58 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:44,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2223 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 04:58:44,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2023-11-29 04:58:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1092. [2023-11-29 04:58:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 676 states have (on average 1.9896449704142012) internal successors, (1345), 1082 states have internal predecessors, (1345), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:58:44,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1359 transitions. [2023-11-29 04:58:44,848 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1359 transitions. Word has length 15 [2023-11-29 04:58:44,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:44,849 INFO L495 AbstractCegarLoop]: Abstraction has 1092 states and 1359 transitions. [2023-11-29 04:58:44,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:58:44,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1359 transitions. [2023-11-29 04:58:44,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 04:58:44,850 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:44,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:44,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:58:45,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:45,051 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:45,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:45,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1177136998, now seen corresponding path program 1 times [2023-11-29 04:58:45,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:45,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154753314] [2023-11-29 04:58:45,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:45,052 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:58:45,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:45,053 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:45,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:45,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:58:45,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:45,217 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:58:45,217 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:45,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154753314] [2023-11-29 04:58:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154753314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:45,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:45,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:58:45,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274707488] [2023-11-29 04:58:45,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:45,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:58:45,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:45,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:58:45,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:58:45,219 INFO L87 Difference]: Start difference. First operand 1092 states and 1359 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:58:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:46,058 INFO L93 Difference]: Finished difference Result 1038 states and 1279 transitions. [2023-11-29 04:58:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:58:46,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2023-11-29 04:58:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:46,064 INFO L225 Difference]: With dead ends: 1038 [2023-11-29 04:58:46,064 INFO L226 Difference]: Without dead ends: 1038 [2023-11-29 04:58:46,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:58:46,065 INFO L413 NwaCegarLoop]: 722 mSDtfsCounter, 70 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:46,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1395 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 04:58:46,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2023-11-29 04:58:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1038. [2023-11-29 04:58:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 646 states have (on average 1.958204334365325) internal successors, (1265), 1028 states have internal predecessors, (1265), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:58:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1279 transitions. [2023-11-29 04:58:46,082 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1279 transitions. Word has length 16 [2023-11-29 04:58:46,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:46,083 INFO L495 AbstractCegarLoop]: Abstraction has 1038 states and 1279 transitions. [2023-11-29 04:58:46,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:58:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1279 transitions. [2023-11-29 04:58:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 04:58:46,084 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:46,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:46,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:58:46,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:46,285 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:46,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:46,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1652258828, now seen corresponding path program 1 times [2023-11-29 04:58:46,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:46,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900523508] [2023-11-29 04:58:46,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:46,286 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:58:46,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:46,287 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:46,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:46,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:58:46,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:46,511 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:58:46,511 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:46,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:46,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900523508] [2023-11-29 04:58:46,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900523508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:46,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:46,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:58:46,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336234568] [2023-11-29 04:58:46,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:46,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:58:46,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:46,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:58:46,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:58:46,513 INFO L87 Difference]: Start difference. First operand 1038 states and 1279 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:58:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:47,502 INFO L93 Difference]: Finished difference Result 1024 states and 1237 transitions. [2023-11-29 04:58:47,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:58:47,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2023-11-29 04:58:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:47,508 INFO L225 Difference]: With dead ends: 1024 [2023-11-29 04:58:47,508 INFO L226 Difference]: Without dead ends: 1024 [2023-11-29 04:58:47,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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:58:47,509 INFO L413 NwaCegarLoop]: 691 mSDtfsCounter, 58 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:47,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2049 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 04:58:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2023-11-29 04:58:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1022. [2023-11-29 04:58:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 644 states have (on average 1.8959627329192548) internal successors, (1221), 1012 states have internal predecessors, (1221), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:58:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1235 transitions. [2023-11-29 04:58:47,530 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1235 transitions. Word has length 18 [2023-11-29 04:58:47,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:47,531 INFO L495 AbstractCegarLoop]: Abstraction has 1022 states and 1235 transitions. [2023-11-29 04:58:47,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:58:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1235 transitions. [2023-11-29 04:58:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:58:47,532 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:47,532 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] [2023-11-29 04:58:47,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:47,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:47,741 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr378REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:47,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:47,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1554712756, now seen corresponding path program 1 times [2023-11-29 04:58:47,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:47,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894551564] [2023-11-29 04:58:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:47,742 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:58:47,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:47,743 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:47,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:47,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:58:47,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:47,883 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:58:47,977 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:58:47,977 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:47,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:47,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894551564] [2023-11-29 04:58:47,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894551564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:47,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:47,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:58:47,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349460743] [2023-11-29 04:58:47,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:47,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:58:47,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:47,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:58:47,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:58:47,980 INFO L87 Difference]: Start difference. First operand 1022 states and 1235 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:58:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:50,162 INFO L93 Difference]: Finished difference Result 1026 states and 1231 transitions. [2023-11-29 04:58:50,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:58:50,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2023-11-29 04:58:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:50,168 INFO L225 Difference]: With dead ends: 1026 [2023-11-29 04:58:50,168 INFO L226 Difference]: Without dead ends: 1026 [2023-11-29 04:58:50,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:58:50,168 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 702 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:50,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 855 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 04:58:50,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2023-11-29 04:58:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1018. [2023-11-29 04:58:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 644 states have (on average 1.8773291925465838) internal successors, (1209), 1008 states have internal predecessors, (1209), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:58:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1223 transitions. [2023-11-29 04:58:50,184 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1223 transitions. Word has length 29 [2023-11-29 04:58:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:50,185 INFO L495 AbstractCegarLoop]: Abstraction has 1018 states and 1223 transitions. [2023-11-29 04:58:50,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:58:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1223 transitions. [2023-11-29 04:58:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:58:50,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:50,186 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] [2023-11-29 04:58:50,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:50,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:50,387 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr379REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:50,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1554712757, now seen corresponding path program 1 times [2023-11-29 04:58:50,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:50,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440598667] [2023-11-29 04:58:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:50,388 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:58:50,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:50,389 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:50,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:50,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:58:50,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:50,543 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:58:50,767 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:58:50,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:50,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:50,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440598667] [2023-11-29 04:58:50,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440598667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:50,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:50,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:58:50,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622308317] [2023-11-29 04:58:50,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:50,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:58:50,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:50,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:58:50,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:58:50,769 INFO L87 Difference]: Start difference. First operand 1018 states and 1223 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:58:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:54,545 INFO L93 Difference]: Finished difference Result 1432 states and 1760 transitions. [2023-11-29 04:58:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:58:54,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2023-11-29 04:58:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:54,553 INFO L225 Difference]: With dead ends: 1432 [2023-11-29 04:58:54,553 INFO L226 Difference]: Without dead ends: 1432 [2023-11-29 04:58:54,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:58:54,554 INFO L413 NwaCegarLoop]: 592 mSDtfsCounter, 324 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:54,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1325 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 04:58:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2023-11-29 04:58:54,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1284. [2023-11-29 04:58:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 908 states have (on average 1.9030837004405285) internal successors, (1728), 1272 states have internal predecessors, (1728), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:58:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1746 transitions. [2023-11-29 04:58:54,579 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1746 transitions. Word has length 29 [2023-11-29 04:58:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:54,579 INFO L495 AbstractCegarLoop]: Abstraction has 1284 states and 1746 transitions. [2023-11-29 04:58:54,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:58:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1746 transitions. [2023-11-29 04:58:54,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 04:58:54,581 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:54,582 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] [2023-11-29 04:58:54,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:58:54,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:54,783 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:54,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:54,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1017517726, now seen corresponding path program 1 times [2023-11-29 04:58:54,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:54,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146697886] [2023-11-29 04:58:54,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:54,785 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:58:54,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:54,786 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:54,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:54,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:58:54,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:54,985 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:58:55,101 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:58:55,101 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:55,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:55,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146697886] [2023-11-29 04:58:55,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146697886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:55,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:55,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:58:55,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786078395] [2023-11-29 04:58:55,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:55,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:58:55,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:55,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:58:55,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:58:55,103 INFO L87 Difference]: Start difference. First operand 1284 states and 1746 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:58:57,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:57,865 INFO L93 Difference]: Finished difference Result 1680 states and 2267 transitions. [2023-11-29 04:58:57,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:58:57,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2023-11-29 04:58:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:57,875 INFO L225 Difference]: With dead ends: 1680 [2023-11-29 04:58:57,876 INFO L226 Difference]: Without dead ends: 1680 [2023-11-29 04:58:57,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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:58:57,877 INFO L413 NwaCegarLoop]: 644 mSDtfsCounter, 746 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:57,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1307 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 04:58:57,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2023-11-29 04:58:57,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1280. [2023-11-29 04:58:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 908 states have (on average 1.894273127753304) internal successors, (1720), 1268 states have internal predecessors, (1720), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:58:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1738 transitions. [2023-11-29 04:58:57,899 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1738 transitions. Word has length 32 [2023-11-29 04:58:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:57,900 INFO L495 AbstractCegarLoop]: Abstraction has 1280 states and 1738 transitions. [2023-11-29 04:58:57,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:58:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1738 transitions. [2023-11-29 04:58:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 04:58:57,901 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:57,901 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] [2023-11-29 04:58:57,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:58:58,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:58,102 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:58:58,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:58,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1017517725, now seen corresponding path program 1 times [2023-11-29 04:58:58,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:58,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165165707] [2023-11-29 04:58:58,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:58,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:58:58,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:58,104 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:58,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:58:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:58,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:58:58,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:58,317 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:58:58,501 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:58:58,501 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:58:58,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165165707] [2023-11-29 04:58:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165165707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:58:58,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:58:58,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:58:58,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874346638] [2023-11-29 04:58:58,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:58:58,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:58:58,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:58:58,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:58:58,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:58:58,503 INFO L87 Difference]: Start difference. First operand 1280 states and 1738 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:59:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:02,557 INFO L93 Difference]: Finished difference Result 1733 states and 2286 transitions. [2023-11-29 04:59:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:59:02,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2023-11-29 04:59:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:02,565 INFO L225 Difference]: With dead ends: 1733 [2023-11-29 04:59:02,565 INFO L226 Difference]: Without dead ends: 1733 [2023-11-29 04:59:02,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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:59:02,566 INFO L413 NwaCegarLoop]: 876 mSDtfsCounter, 476 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:02,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1730 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 04:59:02,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2023-11-29 04:59:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1276. [2023-11-29 04:59:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 908 states have (on average 1.8854625550660793) internal successors, (1712), 1264 states have internal predecessors, (1712), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:59:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1730 transitions. [2023-11-29 04:59:02,587 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1730 transitions. Word has length 32 [2023-11-29 04:59:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:02,587 INFO L495 AbstractCegarLoop]: Abstraction has 1276 states and 1730 transitions. [2023-11-29 04:59:02,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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:59:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1730 transitions. [2023-11-29 04:59:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-29 04:59:02,589 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:02,590 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] [2023-11-29 04:59:02,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:59:02,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:02,790 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:59:02,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:02,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1286566357, now seen corresponding path program 1 times [2023-11-29 04:59:02,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:59:02,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984698434] [2023-11-29 04:59:02,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:02,791 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:59:02,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:59:02,792 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:02,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:02,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:59:02,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:03,001 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:59:03,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:59:03,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:59:03,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984698434] [2023-11-29 04:59:03,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984698434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:59:03,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:59:03,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:59:03,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870027913] [2023-11-29 04:59:03,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:59:03,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:59:03,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:59:03,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:59:03,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:59:03,003 INFO L87 Difference]: Start difference. First operand 1276 states and 1730 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:59:04,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:04,247 INFO L93 Difference]: Finished difference Result 1246 states and 1680 transitions. [2023-11-29 04:59:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:59:04,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2023-11-29 04:59:04,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:04,255 INFO L225 Difference]: With dead ends: 1246 [2023-11-29 04:59:04,255 INFO L226 Difference]: Without dead ends: 1246 [2023-11-29 04:59:04,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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:59:04,256 INFO L413 NwaCegarLoop]: 681 mSDtfsCounter, 31 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2015 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:04,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2015 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 04:59:04,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2023-11-29 04:59:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1246. [2023-11-29 04:59:04,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 878 states have (on average 1.8929384965831435) internal successors, (1662), 1234 states have internal predecessors, (1662), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:59:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1680 transitions. [2023-11-29 04:59:04,275 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1680 transitions. Word has length 48 [2023-11-29 04:59:04,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:04,275 INFO L495 AbstractCegarLoop]: Abstraction has 1246 states and 1680 transitions. [2023-11-29 04:59:04,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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:59:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1680 transitions. [2023-11-29 04:59:04,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 04:59:04,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:04,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:59:04,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:59:04,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:04,477 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:59:04,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1940024075, now seen corresponding path program 1 times [2023-11-29 04:59:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:59:04,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137148626] [2023-11-29 04:59:04,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:04,478 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:59:04,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:59:04,479 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:04,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:04,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:59:04,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:04,774 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:59:04,774 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:59:04,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:59:04,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137148626] [2023-11-29 04:59:04,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137148626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:59:04,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:59:04,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:59:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293085784] [2023-11-29 04:59:04,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:59:04,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:59:04,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:59:04,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:59:04,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:59:04,776 INFO L87 Difference]: Start difference. First operand 1246 states and 1680 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:59:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:05,961 INFO L93 Difference]: Finished difference Result 1234 states and 1660 transitions. [2023-11-29 04:59:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:59:05,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2023-11-29 04:59:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:05,968 INFO L225 Difference]: With dead ends: 1234 [2023-11-29 04:59:05,969 INFO L226 Difference]: Without dead ends: 1234 [2023-11-29 04:59:05,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:59:05,969 INFO L413 NwaCegarLoop]: 677 mSDtfsCounter, 23 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:05,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2011 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 04:59:05,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2023-11-29 04:59:05,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2023-11-29 04:59:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 866 states have (on average 1.8960739030023095) internal successors, (1642), 1222 states have internal predecessors, (1642), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 04:59:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1660 transitions. [2023-11-29 04:59:05,987 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1660 transitions. Word has length 51 [2023-11-29 04:59:05,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:05,987 INFO L495 AbstractCegarLoop]: Abstraction has 1234 states and 1660 transitions. [2023-11-29 04:59:05,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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:59:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1660 transitions. [2023-11-29 04:59:05,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 04:59:05,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:05,988 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] [2023-11-29 04:59:05,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:59:06,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:06,189 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:59:06,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:06,189 INFO L85 PathProgramCache]: Analyzing trace with hash 658159894, now seen corresponding path program 1 times [2023-11-29 04:59:06,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:59:06,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484036526] [2023-11-29 04:59:06,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:06,190 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:59:06,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:59:06,191 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:06,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:06,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:59:06,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:06,396 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:59:06,396 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:59:06,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:59:06,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484036526] [2023-11-29 04:59:06,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484036526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:59:06,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:59:06,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:59:06,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737938996] [2023-11-29 04:59:06,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:59:06,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:59:06,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:59:06,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:59:06,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:59:06,398 INFO L87 Difference]: Start difference. First operand 1234 states and 1660 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:59:07,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:07,326 INFO L93 Difference]: Finished difference Result 1070 states and 1156 transitions. [2023-11-29 04:59:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:59:07,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2023-11-29 04:59:07,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:07,333 INFO L225 Difference]: With dead ends: 1070 [2023-11-29 04:59:07,333 INFO L226 Difference]: Without dead ends: 1070 [2023-11-29 04:59:07,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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:59:07,334 INFO L413 NwaCegarLoop]: 743 mSDtfsCounter, 93 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:07,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1377 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:59:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2023-11-29 04:59:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 933. [2023-11-29 04:59:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 567 states have (on average 1.7601410934744268) internal successors, (998), 923 states have internal predecessors, (998), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:59:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1012 transitions. [2023-11-29 04:59:07,349 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1012 transitions. Word has length 52 [2023-11-29 04:59:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:07,349 INFO L495 AbstractCegarLoop]: Abstraction has 933 states and 1012 transitions. [2023-11-29 04:59:07,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:59:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1012 transitions. [2023-11-29 04:59:07,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 04:59:07,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:07,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:59:07,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:07,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:07,551 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:59:07,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:07,551 INFO L85 PathProgramCache]: Analyzing trace with hash 22290995, now seen corresponding path program 1 times [2023-11-29 04:59:07,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:59:07,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559840277] [2023-11-29 04:59:07,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:07,552 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:59:07,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:59:07,553 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:07,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:07,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:59:07,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:07,798 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:59:07,799 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:59:07,800 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:59:07,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2023-11-29 04:59:07,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:59:07,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-11-29 04:59:07,929 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:59:07,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:59:07,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:59:07,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559840277] [2023-11-29 04:59:07,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559840277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:59:07,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:59:07,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:59:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589531522] [2023-11-29 04:59:07,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:59:07,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:59:07,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:59:07,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:59:07,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:59:07,942 INFO L87 Difference]: Start difference. First operand 933 states and 1012 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:59:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:10,525 INFO L93 Difference]: Finished difference Result 1562 states and 1677 transitions. [2023-11-29 04:59:10,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:59:10,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-11-29 04:59:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:10,532 INFO L225 Difference]: With dead ends: 1562 [2023-11-29 04:59:10,532 INFO L226 Difference]: Without dead ends: 1559 [2023-11-29 04:59:10,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:59:10,532 INFO L413 NwaCegarLoop]: 858 mSDtfsCounter, 1471 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 3215 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:10,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1481 Valid, 3215 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 04:59:10,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2023-11-29 04:59:10,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 885. [2023-11-29 04:59:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 520 states have (on average 1.8269230769230769) internal successors, (950), 876 states have internal predecessors, (950), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:59:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 962 transitions. [2023-11-29 04:59:10,554 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 962 transitions. Word has length 55 [2023-11-29 04:59:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:10,554 INFO L495 AbstractCegarLoop]: Abstraction has 885 states and 962 transitions. [2023-11-29 04:59:10,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:59:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 962 transitions. [2023-11-29 04:59:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 04:59:10,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:10,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:59:10,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:59:10,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:10,755 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:59:10,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2012710710, now seen corresponding path program 1 times [2023-11-29 04:59:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:59:10,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635935714] [2023-11-29 04:59:10,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:10,756 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:59:10,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:59:10,757 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:10,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Waiting until timeout for monitored process [2023-11-29 04:59:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:11,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 04:59:11,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:11,095 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:59:11,103 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:59:11,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:59:11,599 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:59:11,613 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:59:11,614 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:59:11,630 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:59:11,630 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:59:11,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:59:11,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635935714] [2023-11-29 04:59:11,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635935714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:59:11,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:59:11,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:59:11,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747660996] [2023-11-29 04:59:11,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:59:11,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:59:11,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:59:11,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:59:11,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:59:11,632 INFO L87 Difference]: Start difference. First operand 885 states and 962 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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:59:14,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:14,672 INFO L93 Difference]: Finished difference Result 1183 states and 1285 transitions. [2023-11-29 04:59:14,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:59:14,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2023-11-29 04:59:14,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:14,680 INFO L225 Difference]: With dead ends: 1183 [2023-11-29 04:59:14,680 INFO L226 Difference]: Without dead ends: 1183 [2023-11-29 04:59:14,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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:59:14,681 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 954 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:14,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 346 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 04:59:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2023-11-29 04:59:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 824. [2023-11-29 04:59:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 497 states have (on average 1.7203219315895373) internal successors, (855), 815 states have internal predecessors, (855), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:59:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 867 transitions. [2023-11-29 04:59:14,697 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 867 transitions. Word has length 55 [2023-11-29 04:59:14,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:14,697 INFO L495 AbstractCegarLoop]: Abstraction has 824 states and 867 transitions. [2023-11-29 04:59:14,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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:59:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 867 transitions. [2023-11-29 04:59:14,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 04:59:14,698 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:14,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:59:14,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:59:14,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:14,898 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:59:14,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:14,899 INFO L85 PathProgramCache]: Analyzing trace with hash 944326677, now seen corresponding path program 1 times [2023-11-29 04:59:14,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:59:14,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321649207] [2023-11-29 04:59:14,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:14,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:59:14,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:59:14,900 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:14,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:15,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:59:15,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:15,182 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:59:15,201 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:59:15,226 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:59:15,237 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:59:15,237 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:59:15,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:59:15,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321649207] [2023-11-29 04:59:15,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321649207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:59:15,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:59:15,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:59:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464360955] [2023-11-29 04:59:15,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:59:15,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:59:15,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:59:15,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:59:15,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:59:15,240 INFO L87 Difference]: Start difference. First operand 824 states and 867 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:59:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:18,120 INFO L93 Difference]: Finished difference Result 823 states and 866 transitions. [2023-11-29 04:59:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:59:18,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2023-11-29 04:59:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:18,124 INFO L225 Difference]: With dead ends: 823 [2023-11-29 04:59:18,124 INFO L226 Difference]: Without dead ends: 823 [2023-11-29 04:59:18,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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:59:18,125 INFO L413 NwaCegarLoop]: 651 mSDtfsCounter, 3 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:18,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1690 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 04:59:18,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2023-11-29 04:59:18,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 823. [2023-11-29 04:59:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 497 states have (on average 1.7183098591549295) internal successors, (854), 814 states have internal predecessors, (854), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:59:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 866 transitions. [2023-11-29 04:59:18,137 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 866 transitions. Word has length 59 [2023-11-29 04:59:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:18,137 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 866 transitions. [2023-11-29 04:59:18,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:59:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 866 transitions. [2023-11-29 04:59:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 04:59:18,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:18,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:59:18,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:18,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:18,338 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:59:18,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:18,339 INFO L85 PathProgramCache]: Analyzing trace with hash 944326678, now seen corresponding path program 1 times [2023-11-29 04:59:18,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:59:18,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127212218] [2023-11-29 04:59:18,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:18,339 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:59:18,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:59:18,340 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:18,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Waiting until timeout for monitored process [2023-11-29 04:59:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:18,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 04:59:18,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:18,651 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:59:18,677 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:59:18,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 04:59:18,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 04:59:18,748 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:59:18,748 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:59:18,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:59:18,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127212218] [2023-11-29 04:59:18,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127212218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:59:18,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:59:18,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:59:18,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970076303] [2023-11-29 04:59:18,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:59:18,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:59:18,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:59:18,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:59:18,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:59:18,750 INFO L87 Difference]: Start difference. First operand 823 states and 866 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:59:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:22,438 INFO L93 Difference]: Finished difference Result 822 states and 865 transitions. [2023-11-29 04:59:22,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:59:22,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2023-11-29 04:59:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:22,442 INFO L225 Difference]: With dead ends: 822 [2023-11-29 04:59:22,442 INFO L226 Difference]: Without dead ends: 822 [2023-11-29 04:59:22,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:59:22,443 INFO L413 NwaCegarLoop]: 651 mSDtfsCounter, 1 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:22,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1717 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-29 04:59:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2023-11-29 04:59:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2023-11-29 04:59:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 496 states have (on average 1.719758064516129) internal successors, (853), 813 states have internal predecessors, (853), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:59:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 865 transitions. [2023-11-29 04:59:22,454 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 865 transitions. Word has length 59 [2023-11-29 04:59:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:22,455 INFO L495 AbstractCegarLoop]: Abstraction has 822 states and 865 transitions. [2023-11-29 04:59:22,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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:59:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 865 transitions. [2023-11-29 04:59:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 04:59:22,455 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:22,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:59:22,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Ended with exit code 0 [2023-11-29 04:59:22,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:22,656 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:59:22,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:22,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1007278521, now seen corresponding path program 1 times [2023-11-29 04:59:22,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:59:22,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064776875] [2023-11-29 04:59:22,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:22,657 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:59:22,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:59:22,658 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:22,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:22,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:59:22,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:22,965 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:59:22,965 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:59:22,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:59:22,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064776875] [2023-11-29 04:59:22,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064776875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:59:22,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:59:22,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:59:22,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905809260] [2023-11-29 04:59:22,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:59:22,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:59:22,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:59:22,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:59:22,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:59:22,968 INFO L87 Difference]: Start difference. First operand 822 states and 865 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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:59:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:23,979 INFO L93 Difference]: Finished difference Result 824 states and 868 transitions. [2023-11-29 04:59:23,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:59:23,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2023-11-29 04:59:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:23,986 INFO L225 Difference]: With dead ends: 824 [2023-11-29 04:59:23,987 INFO L226 Difference]: Without dead ends: 824 [2023-11-29 04:59:23,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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:59:23,988 INFO L413 NwaCegarLoop]: 651 mSDtfsCounter, 1 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:23,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1950 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 04:59:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2023-11-29 04:59:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2023-11-29 04:59:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 497 states have (on average 1.7203219315895373) internal successors, (855), 815 states have internal predecessors, (855), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 04:59:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 868 transitions. [2023-11-29 04:59:24,007 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 868 transitions. Word has length 65 [2023-11-29 04:59:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:24,008 INFO L495 AbstractCegarLoop]: Abstraction has 824 states and 868 transitions. [2023-11-29 04:59:24,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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:59:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 868 transitions. [2023-11-29 04:59:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-29 04:59:24,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:24,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:59:24,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:59:24,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:24,209 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:59:24,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:24,209 INFO L85 PathProgramCache]: Analyzing trace with hash -11277462, now seen corresponding path program 1 times [2023-11-29 04:59:24,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:59:24,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701386926] [2023-11-29 04:59:24,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:59:24,210 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:59:24,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:59:24,211 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:24,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Waiting until timeout for monitored process [2023-11-29 04:59:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:59:24,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:59:24,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:24,534 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:59:24,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:59:24,621 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:59:24,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:59:24,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701386926] [2023-11-29 04:59:24,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701386926] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:59:24,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:59:24,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 04:59:24,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625981907] [2023-11-29 04:59:24,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:59:24,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:59:24,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:59:24,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:59:24,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:59:24,624 INFO L87 Difference]: Start difference. First operand 824 states and 868 transitions. Second operand has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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:59:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:26,035 INFO L93 Difference]: Finished difference Result 833 states and 882 transitions. [2023-11-29 04:59:26,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:59:26,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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 66 [2023-11-29 04:59:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:26,039 INFO L225 Difference]: With dead ends: 833 [2023-11-29 04:59:26,039 INFO L226 Difference]: Without dead ends: 833 [2023-11-29 04:59:26,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:59:26,040 INFO L413 NwaCegarLoop]: 650 mSDtfsCounter, 7 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:26,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2596 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 04:59:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2023-11-29 04:59:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 832. [2023-11-29 04:59:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 504 states have (on average 1.7222222222222223) internal successors, (868), 822 states have internal predecessors, (868), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 04:59:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 881 transitions. [2023-11-29 04:59:26,053 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 881 transitions. Word has length 66 [2023-11-29 04:59:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:26,053 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 881 transitions. [2023-11-29 04:59:26,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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:59:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 881 transitions. [2023-11-29 04:59:26,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 04:59:26,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:26,054 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:59:26,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Ended with exit code 0 [2023-11-29 04:59:26,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:26,255 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:59:26,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:26,255 INFO L85 PathProgramCache]: Analyzing trace with hash -958841351, now seen corresponding path program 2 times [2023-11-29 04:59:26,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:59:26,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766296471] [2023-11-29 04:59:26,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:59:26,256 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:59:26,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:59:26,257 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:26,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:26,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:59:26,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:59:26,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:59:26,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:26,832 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:59:26,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:59:26,988 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:59:26,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:59:26,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766296471] [2023-11-29 04:59:26,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766296471] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:59:26,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:59:26,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 04:59:26,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796236695] [2023-11-29 04:59:26,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:59:26,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:59:26,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:59:26,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:59:26,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:59:26,991 INFO L87 Difference]: Start difference. First operand 832 states and 881 transitions. Second operand has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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:59:29,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:29,663 INFO L93 Difference]: Finished difference Result 847 states and 903 transitions. [2023-11-29 04:59:29,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 04:59:29,664 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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 69 [2023-11-29 04:59:29,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:29,667 INFO L225 Difference]: With dead ends: 847 [2023-11-29 04:59:29,667 INFO L226 Difference]: Without dead ends: 845 [2023-11-29 04:59:29,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 04:59:29,668 INFO L413 NwaCegarLoop]: 650 mSDtfsCounter, 13 mSDsluCounter, 3892 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4542 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:29,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4542 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 04:59:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2023-11-29 04:59:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 841. [2023-11-29 04:59:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 513 states have (on average 1.7153996101364521) internal successors, (880), 831 states have internal predecessors, (880), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 04:59:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 893 transitions. [2023-11-29 04:59:29,685 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 893 transitions. Word has length 69 [2023-11-29 04:59:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:29,685 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 893 transitions. [2023-11-29 04:59:29,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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:59:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 893 transitions. [2023-11-29 04:59:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 04:59:29,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:29,686 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:59:29,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:29,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:29,887 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:59:29,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:29,887 INFO L85 PathProgramCache]: Analyzing trace with hash -703162279, now seen corresponding path program 3 times [2023-11-29 04:59:29,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:59:29,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002515697] [2023-11-29 04:59:29,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:59:29,888 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:59:29,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:59:29,889 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:29,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (28)] Waiting until timeout for monitored process [2023-11-29 04:59:30,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 04:59:30,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:59:30,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:59:30,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:30,858 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:59:30,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:59:31,651 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:59:31,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:59:31,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002515697] [2023-11-29 04:59:31,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002515697] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:59:31,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:59:31,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 04:59:31,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324832988] [2023-11-29 04:59:31,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:59:31,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 04:59:31,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:59:31,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 04:59:31,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:59:31,654 INFO L87 Difference]: Start difference. First operand 841 states and 893 transitions. Second operand has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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:59:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:39,281 INFO L93 Difference]: Finished difference Result 871 states and 943 transitions. [2023-11-29 04:59:39,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 04:59:39,283 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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 75 [2023-11-29 04:59:39,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:39,286 INFO L225 Difference]: With dead ends: 871 [2023-11-29 04:59:39,286 INFO L226 Difference]: Without dead ends: 868 [2023-11-29 04:59:39,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 04:59:39,288 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 24 mSDsluCounter, 10359 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 11008 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:39,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 11008 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-11-29 04:59:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2023-11-29 04:59:39,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 859. [2023-11-29 04:59:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 531 states have (on average 1.7005649717514124) internal successors, (903), 849 states have internal predecessors, (903), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 04:59:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 916 transitions. [2023-11-29 04:59:39,305 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 916 transitions. Word has length 75 [2023-11-29 04:59:39,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:39,306 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 916 transitions. [2023-11-29 04:59:39,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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:59:39,306 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 916 transitions. [2023-11-29 04:59:39,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-29 04:59:39,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:39,307 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:59:39,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (28)] Ended with exit code 0 [2023-11-29 04:59:39,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:39,508 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:59:39,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:39,508 INFO L85 PathProgramCache]: Analyzing trace with hash 669480217, now seen corresponding path program 4 times [2023-11-29 04:59:39,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:59:39,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739558854] [2023-11-29 04:59:39,509 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:59:39,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:59:39,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:59:39,510 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:39,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:39,919 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:59:39,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:59:39,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 04:59:39,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:40,333 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:59:40,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:59:42,167 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:59:42,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:59:42,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739558854] [2023-11-29 04:59:42,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739558854] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:59:42,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:59:42,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 04:59:42,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042208143] [2023-11-29 04:59:42,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:59:42,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 04:59:42,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:59:42,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 04:59:42,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 04:59:42,171 INFO L87 Difference]: Start difference. First operand 859 states and 916 transitions. Second operand has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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:59:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:59:57,927 INFO L93 Difference]: Finished difference Result 916 states and 1005 transitions. [2023-11-29 04:59:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 04:59:57,928 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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 87 [2023-11-29 04:59:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:59:57,930 INFO L225 Difference]: With dead ends: 916 [2023-11-29 04:59:57,930 INFO L226 Difference]: Without dead ends: 914 [2023-11-29 04:59:57,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 04:59:57,935 INFO L413 NwaCegarLoop]: 650 mSDtfsCounter, 48 mSDsluCounter, 14927 mSDsCounter, 0 mSdLazyCounter, 4308 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 15577 SdHoareTripleChecker+Invalid, 4388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:59:57,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 15577 Invalid, 4388 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 4308 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2023-11-29 04:59:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2023-11-29 04:59:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 893. [2023-11-29 04:59:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 565 states have (on average 1.679646017699115) internal successors, (949), 883 states have internal predecessors, (949), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 04:59:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 962 transitions. [2023-11-29 04:59:57,952 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 962 transitions. Word has length 87 [2023-11-29 04:59:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:59:57,952 INFO L495 AbstractCegarLoop]: Abstraction has 893 states and 962 transitions. [2023-11-29 04:59:57,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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:59:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 962 transitions. [2023-11-29 04:59:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 04:59:57,953 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:59:57,954 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] [2023-11-29 04:59:57,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:58,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:58,154 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 04:59:58,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:59:58,155 INFO L85 PathProgramCache]: Analyzing trace with hash -93828999, now seen corresponding path program 5 times [2023-11-29 04:59:58,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:59:58,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710280441] [2023-11-29 04:59:58,156 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:59:58,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:59:58,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:59:58,157 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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:59:58,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (30)] Waiting until timeout for monitored process [2023-11-29 04:59:59,658 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 04:59:59,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:59:59,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-29 04:59:59,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:59:59,703 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:59:59,811 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:59:59,811 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:59:59,846 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:59:59,943 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 05:00:00,922 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:00:00,922 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 05:00:00,967 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 05:00:01,007 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 05:00:01,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:00:01,489 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2193 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2193) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-11-29 05:00:01,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:00:01,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710280441] [2023-11-29 05:00:01,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710280441] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:00:01,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1968175234] [2023-11-29 05:00:01,492 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:00:01,492 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:00:01,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:00:01,493 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:00:01,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 05:01:06,506 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 05:01:06,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:01:06,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 05:01:06,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:01:06,718 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 05:01:07,046 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:01:07,047 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 05:01:07,112 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 05:01:07,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 05:01:08,276 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:01:08,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:01:08,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 05:01:08,371 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 05:01:08,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:01:12,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1968175234] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:01:12,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:01:12,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 05:01:12,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266031278] [2023-11-29 05:01:12,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:01:12,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:01:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:01:12,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:01:12,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=186, Unknown=3, NotChecked=28, Total=272 [2023-11-29 05:01:12,781 INFO L87 Difference]: Start difference. First operand 893 states and 962 transitions. Second operand has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 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 05:01:19,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:01:19,814 INFO L93 Difference]: Finished difference Result 1230 states and 1322 transitions. [2023-11-29 05:01:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:01:19,816 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 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 109 [2023-11-29 05:01:19,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:01:19,818 INFO L225 Difference]: With dead ends: 1230 [2023-11-29 05:01:19,818 INFO L226 Difference]: Without dead ends: 1228 [2023-11-29 05:01:19,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=64, Invalid=209, Unknown=3, NotChecked=30, Total=306 [2023-11-29 05:01:19,819 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 634 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 2787 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 2794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:01:19,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 2435 Invalid, 2794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2787 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2023-11-29 05:01:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2023-11-29 05:01:19,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 892. [2023-11-29 05:01:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 565 states have (on average 1.6707964601769911) internal successors, (944), 882 states have internal predecessors, (944), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 05:01:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 957 transitions. [2023-11-29 05:01:19,835 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 957 transitions. Word has length 109 [2023-11-29 05:01:19,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:01:19,835 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 957 transitions. [2023-11-29 05:01:19,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 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 05:01:19,836 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 957 transitions. [2023-11-29 05:01:19,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 05:01:19,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:01:19,837 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] [2023-11-29 05:01:19,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (30)] Ended with exit code 0 [2023-11-29 05:01:20,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 05:01:20,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:01:20,238 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:01:20,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:01:20,238 INFO L85 PathProgramCache]: Analyzing trace with hash -93828998, now seen corresponding path program 1 times [2023-11-29 05:01:20,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:01:20,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313843977] [2023-11-29 05:01:20,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:01:20,239 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 05:01:20,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:01:20,239 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 05:01:20,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Waiting until timeout for monitored process [2023-11-29 05:01:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:01:20,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 05:01:20,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:01:20,943 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 05:01:21,091 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 05:01:21,108 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:01:21,109 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 05:01:21,139 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 05:01:21,158 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 05:01:21,274 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 05:01:21,279 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 05:01:22,132 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:01:22,132 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 05:01:22,158 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 05:01:22,211 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 05:01:22,217 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 05:01:22,254 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 05:01:22,255 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:01:23,623 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3208 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3209 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3209) |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~mem38#1.base| v_ArrVal_3208) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3209 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3209) |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 05:01:23,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:01:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313843977] [2023-11-29 05:01:23,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313843977] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:01:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [903896951] [2023-11-29 05:01:23,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:01:23,631 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:01:23,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:01:23,632 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:01:23,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 05:03:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:04,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 05:03:04,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:03:04,972 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 05:03:05,323 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:03:05,324 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 05:03:05,332 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 05:03:05,402 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 05:03:05,407 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 05:03:05,557 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 05:03:05,562 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 05:03:06,393 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:03:06,393 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 05:03:06,403 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 05:03:06,521 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 05:03:06,530 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 05:03:06,536 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 05:03:06,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:03:07,836 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3762 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3762) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3762 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3762) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3763) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:03:07,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [903896951] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:03:07,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:03:07,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 05:03:07,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44036289] [2023-11-29 05:03:07,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:03:07,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:03:07,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:03:07,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:03:07,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-29 05:03:07,842 INFO L87 Difference]: Start difference. First operand 892 states and 957 transitions. Second operand has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 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 05:03:18,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:03:18,349 INFO L93 Difference]: Finished difference Result 1227 states and 1317 transitions. [2023-11-29 05:03:18,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:03:18,351 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 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 109 [2023-11-29 05:03:18,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:03:18,353 INFO L225 Difference]: With dead ends: 1227 [2023-11-29 05:03:18,353 INFO L226 Difference]: Without dead ends: 1227 [2023-11-29 05:03:18,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-11-29 05:03:18,353 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 640 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 4011 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 4021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:03:18,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1948 Invalid, 4021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 4011 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2023-11-29 05:03:18,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2023-11-29 05:03:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 891. [2023-11-29 05:03:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 565 states have (on average 1.6690265486725664) internal successors, (943), 881 states have internal predecessors, (943), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 05:03:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 956 transitions. [2023-11-29 05:03:18,364 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 956 transitions. Word has length 109 [2023-11-29 05:03:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:03:18,365 INFO L495 AbstractCegarLoop]: Abstraction has 891 states and 956 transitions. [2023-11-29 05:03:18,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.1) internal successors, (121), 13 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 05:03:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 956 transitions. [2023-11-29 05:03:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 05:03:18,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:03:18,366 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:03:18,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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)] Ended with exit code 0 [2023-11-29 05:03:18,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 05:03:18,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:03:18,766 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:03:18,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:03:18,767 INFO L85 PathProgramCache]: Analyzing trace with hash 25991402, now seen corresponding path program 1 times [2023-11-29 05:03:18,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:03:18,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741893369] [2023-11-29 05:03:18,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:18,767 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 05:03:18,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:03:18,768 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 05:03:18,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (34)] Waiting until timeout for monitored process [2023-11-29 05:03:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:19,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 05:03:19,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:03:19,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:03:19,731 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:03:19,732 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 05:03:19,765 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 05:03:19,894 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 05:03:20,900 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:03:20,900 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 05:03:21,036 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:03:21,036 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 05:03:21,056 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 05:03:21,100 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 05:03:21,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:03:21,170 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4186) |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 05:03:21,184 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4186 (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_4186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 05:03:21,604 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4232 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4232))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4186)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:03:21,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:03:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741893369] [2023-11-29 05:03:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741893369] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:03:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [650895885] [2023-11-29 05:03:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:21,607 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:03:21,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:03:21,608 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:03:21,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 05:03:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:25,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 05:03:25,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:03:25,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:03:25,858 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:03:25,858 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 05:03:25,938 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 05:03:26,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 05:03:27,098 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:03:27,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:03:27,271 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:03:27,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:03:27,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 27 treesize of output 15 [2023-11-29 05:03:27,303 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 05:03:27,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:03:31,396 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4655 (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_4655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:03:31,794 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4701 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4701))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4655)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:03:31,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [650895885] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:03:31,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:03:31,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 05:03:31,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559488243] [2023-11-29 05:03:31,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:03:31,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 05:03:31,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:03:31,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 05:03:31,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=244, Unknown=6, NotChecked=180, Total=506 [2023-11-29 05:03:31,798 INFO L87 Difference]: Start difference. First operand 891 states and 956 transitions. Second operand has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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 05:03:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:03:38,462 INFO L93 Difference]: Finished difference Result 1226 states and 1316 transitions. [2023-11-29 05:03:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:03:38,463 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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 111 [2023-11-29 05:03:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:03:38,465 INFO L225 Difference]: With dead ends: 1226 [2023-11-29 05:03:38,465 INFO L226 Difference]: Without dead ends: 1226 [2023-11-29 05:03:38,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=85, Invalid=271, Unknown=6, NotChecked=190, Total=552 [2023-11-29 05:03:38,466 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 629 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 2361 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:03:38,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 2078 Invalid, 2367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2361 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-11-29 05:03:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2023-11-29 05:03:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 890. [2023-11-29 05:03:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 565 states have (on average 1.6672566371681417) internal successors, (942), 880 states have internal predecessors, (942), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 05:03:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 955 transitions. [2023-11-29 05:03:38,476 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 955 transitions. Word has length 111 [2023-11-29 05:03:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:03:38,476 INFO L495 AbstractCegarLoop]: Abstraction has 890 states and 955 transitions. [2023-11-29 05:03:38,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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 05:03:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 955 transitions. [2023-11-29 05:03:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 05:03:38,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:03:38,477 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:03:38,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 05:03:38,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (34)] Ended with exit code 0 [2023-11-29 05:03:38,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 05:03:38,878 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:03:38,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:03:38,878 INFO L85 PathProgramCache]: Analyzing trace with hash 25991403, now seen corresponding path program 1 times [2023-11-29 05:03:38,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:03:38,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393281196] [2023-11-29 05:03:38,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:38,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:03:38,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:03:38,880 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 05:03:38,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (36)] Waiting until timeout for monitored process [2023-11-29 05:03:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:39,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 05:03:39,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:03:39,715 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 05:03:39,871 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:03:39,872 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 05:03:39,879 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 05:03:39,911 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 05:03:39,928 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 05:03:40,055 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 05:03:40,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 05:03:40,902 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:03:40,903 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 05:03:40,914 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 05:03:41,055 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:03:41,055 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 05:03:41,062 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 05:03:41,087 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 05:03:41,096 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 05:03:41,135 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 05:03:41,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:03:41,316 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5171 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5170 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5171) |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~mem40#1.base| v_ArrVal_5170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:03:41,354 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_5171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5170 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_5170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5171 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5171) |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 05:03:42,670 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5170 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5262))) (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~mem38#1.base| v_ArrVal_5263) .cse0 v_ArrVal_5171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5170) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5262 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5263 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5263) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5262) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5171) |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 05:03:42,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:03:42,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393281196] [2023-11-29 05:03:42,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393281196] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:03:42,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [587478337] [2023-11-29 05:03:42,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:42,681 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:03:42,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:03:42,682 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:03:42,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 05:03:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:46,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 05:03:46,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:03:46,539 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 05:03:46,901 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 05:03:46,917 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:03:46,917 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 05:03:46,989 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 05:03:46,996 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 05:03:47,163 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 05:03:47,169 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 05:03:47,954 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:03:47,954 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 05:03:47,961 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 05:03:48,176 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:03:48,177 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 05:03:48,187 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 05:03:48,208 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 05:03:48,216 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 05:03:48,218 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 05:03:48,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:03:48,295 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2023-11-29 05:03:48,332 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_5733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-11-29 05:03:49,770 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5824) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5825) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5825))) (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~mem38#1.base| v_ArrVal_5824) .cse2 v_ArrVal_5733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 05:03:49,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [587478337] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:03:49,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:03:49,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 05:03:49,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448684543] [2023-11-29 05:03:49,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:03:49,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 05:03:49,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:03:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 05:03:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 05:03:49,785 INFO L87 Difference]: Start difference. First operand 890 states and 955 transitions. Second operand has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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 05:04:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:04:06,762 INFO L93 Difference]: Finished difference Result 1225 states and 1315 transitions. [2023-11-29 05:04:06,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:04:06,764 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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 111 [2023-11-29 05:04:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:04:06,766 INFO L225 Difference]: With dead ends: 1225 [2023-11-29 05:04:06,766 INFO L226 Difference]: Without dead ends: 1225 [2023-11-29 05:04:06,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 05:04:06,767 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 634 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 6693 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 2955 SdHoareTripleChecker+Invalid, 6702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 6693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:04:06,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 2955 Invalid, 6702 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9 Valid, 6693 Invalid, 0 Unknown, 0 Unchecked, 16.6s Time] [2023-11-29 05:04:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2023-11-29 05:04:06,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 889. [2023-11-29 05:04:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 565 states have (on average 1.665486725663717) internal successors, (941), 879 states have internal predecessors, (941), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 05:04:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 954 transitions. [2023-11-29 05:04:06,778 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 954 transitions. Word has length 111 [2023-11-29 05:04:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:04:06,778 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 954 transitions. [2023-11-29 05:04:06,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.416666666666666) internal successors, (125), 15 states have internal predecessors, (125), 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 05:04:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 954 transitions. [2023-11-29 05:04:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 05:04:06,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:04:06,780 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:04:06,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 05:04:06,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (36)] Ended with exit code 0 [2023-11-29 05:04:07,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 05:04:07,180 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:04:07,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:04:07,181 INFO L85 PathProgramCache]: Analyzing trace with hash -790724809, now seen corresponding path program 1 times [2023-11-29 05:04:07,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:04:07,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781998979] [2023-11-29 05:04:07,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:04:07,182 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 05:04:07,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:04:07,182 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 05:04:07,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (38)] Waiting until timeout for monitored process [2023-11-29 05:04:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:04:08,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 05:04:08,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:04:08,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:04:08,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:04:08,324 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:04:08,324 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 05:04:08,357 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 05:04:08,372 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 05:04:08,506 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 05:04:08,512 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 05:04:09,365 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:04:09,365 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 05:04:09,373 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 05:04:09,522 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:04:09,523 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 05:04:09,530 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 05:04:09,650 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:04:09,651 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 05:04:09,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 05:04:09,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 05:04:09,698 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 05:04:09,734 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 05:04:09,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:04:09,928 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:04:09,962 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_6312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6311) |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_6312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6311) |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 05:04:10,049 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6309))) (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~mem40#1.base| v_ArrVal_6310) .cse0 v_ArrVal_6311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6310) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6311) |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 05:04:10,104 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_6309))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6310) .cse1 v_ArrVal_6311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6310) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_6309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 05:04:11,543 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6404))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6309))) (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~mem38#1.base| v_ArrVal_6403) .cse0 v_ArrVal_6310) .cse1 v_ArrVal_6311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6404))) (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~mem38#1.base| v_ArrVal_6403) .cse6 v_ArrVal_6310) (select (select (store .cse7 .cse6 v_ArrVal_6309) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6311))) |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 05:04:11,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:04:11,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781998979] [2023-11-29 05:04:11,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781998979] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:04:11,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [866594292] [2023-11-29 05:04:11,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:04:11,558 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:04:11,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:04:11,559 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:04:11,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 05:04:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:04:48,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 05:04:48,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:04:48,224 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 05:04:48,565 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 05:04:48,584 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:04:48,584 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 05:04:48,656 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 05:04:48,671 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 05:04:48,856 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 05:04:48,861 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 05:04:49,598 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:04:49,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 05:04:49,605 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 05:04:49,787 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:04:49,787 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 05:04:49,797 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 05:04:49,892 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:04:49,893 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 05:04:49,900 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 05:04:49,915 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 05:04:49,921 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 05:04:49,925 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 05:04:49,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:04:49,980 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6891 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6890) |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~mem41#1.base| v_ArrVal_6891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6890 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6890) |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 05:04:50,013 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_6890 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6891 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 05:04:50,111 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6888) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6891 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6889))) (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~mem40#1.base| v_ArrVal_6888) .cse2 v_ArrVal_6890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 05:04:50,255 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6891 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_6889))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6888) .cse1 v_ArrVal_6890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6888) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_6889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 05:04:51,615 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6982 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6983))) (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~mem38#1.base| v_ArrVal_6982) .cse1 v_ArrVal_6888) (select (select (store .cse2 .cse1 v_ArrVal_6889) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6890))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6982 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6983))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6889))) (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~mem38#1.base| v_ArrVal_6982) .cse4 v_ArrVal_6888) .cse5 v_ArrVal_6890) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 05:04:51,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [866594292] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:04:51,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:04:51,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 05:04:51,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639881187] [2023-11-29 05:04:51,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:04:51,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 05:04:51,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:04:51,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:04:51,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 05:04:51,630 INFO L87 Difference]: Start difference. First operand 889 states and 954 transitions. Second operand has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 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 05:05:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:03,458 INFO L93 Difference]: Finished difference Result 1224 states and 1314 transitions. [2023-11-29 05:05:03,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:05:03,460 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 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 113 [2023-11-29 05:05:03,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:03,461 INFO L225 Difference]: With dead ends: 1224 [2023-11-29 05:05:03,461 INFO L226 Difference]: Without dead ends: 1224 [2023-11-29 05:05:03,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 05:05:03,462 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 634 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 4559 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 4568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 4559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:03,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 2154 Invalid, 4568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 4559 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2023-11-29 05:05:03,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2023-11-29 05:05:03,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 888. [2023-11-29 05:05:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 565 states have (on average 1.663716814159292) internal successors, (940), 878 states have internal predecessors, (940), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 05:05:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 953 transitions. [2023-11-29 05:05:03,471 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 953 transitions. Word has length 113 [2023-11-29 05:05:03,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:03,471 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 953 transitions. [2023-11-29 05:05:03,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 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 05:05:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 953 transitions. [2023-11-29 05:05:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-29 05:05:03,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:03,472 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:05:03,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-29 05:05:03,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (38)] Ended with exit code 0 [2023-11-29 05:05:03,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 05:05:03,872 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:03,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash -790724810, now seen corresponding path program 1 times [2023-11-29 05:05:03,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:03,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21560658] [2023-11-29 05:05:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:03,873 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 05:05:03,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:03,874 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 05:05:03,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (40)] Waiting until timeout for monitored process [2023-11-29 05:05:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:04,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 05:05:04,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:04,824 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 05:05:04,952 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:05:04,952 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 05:05:04,982 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 05:05:05,078 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 05:05:06,069 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:05:06,069 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 05:05:06,178 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:05:06,178 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 05:05:06,271 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:05:06,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:05:06,287 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 05:05:06,331 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 05:05:06,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:05:06,401 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7422 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7422) |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 05:05:06,413 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7422 (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_7422) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 05:05:06,506 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7422 (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_7421))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7422)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:05:06,873 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7422 (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~mem38#1.base| v_ArrVal_7468))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7421)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7422)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:05:06,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:05:06,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21560658] [2023-11-29 05:05:06,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21560658] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:05:06,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1661447348] [2023-11-29 05:05:06,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:06,876 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:05:06,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:05:06,877 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:05:06,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-29 05:05:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:42,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 05:05:42,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:42,212 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 05:05:42,559 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:05:42,559 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 05:05:42,617 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 05:05:42,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 05:05:43,607 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:05:43,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 36 treesize of output 35 [2023-11-29 05:05:43,767 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:05:43,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:05:43,862 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:05:43,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:05:43,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 05:05:43,889 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 05:05:43,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:05:47,979 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7908 (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_7908) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:05:47,992 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7907 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7908 (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~mem40#1.base| v_ArrVal_7907))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7908)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:05:48,006 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7907 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7908 (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_7907))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7908)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:05:48,407 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7907 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7908 (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~mem38#1.base| v_ArrVal_7954))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7907)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7908)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:05:48,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1661447348] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:05:48,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:05:48,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 05:05:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049740254] [2023-11-29 05:05:48,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:05:48,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 05:05:48,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:05:48,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:05:48,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=340, Unknown=13, NotChecked=360, Total=812 [2023-11-29 05:05:48,413 INFO L87 Difference]: Start difference. First operand 888 states and 953 transitions. Second operand has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 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 05:05:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:55,800 INFO L93 Difference]: Finished difference Result 1223 states and 1313 transitions. [2023-11-29 05:05:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:05:55,801 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 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 113 [2023-11-29 05:05:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:55,803 INFO L225 Difference]: With dead ends: 1223 [2023-11-29 05:05:55,803 INFO L226 Difference]: Without dead ends: 1223 [2023-11-29 05:05:55,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=108, Invalid=373, Unknown=13, NotChecked=376, Total=870 [2023-11-29 05:05:55,804 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 621 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 3183 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 2768 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:55,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 2768 Invalid, 3190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3183 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2023-11-29 05:05:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2023-11-29 05:05:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 887. [2023-11-29 05:05:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 565 states have (on average 1.6619469026548672) internal successors, (939), 877 states have internal predecessors, (939), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 05:05:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 952 transitions. [2023-11-29 05:05:55,817 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 952 transitions. Word has length 113 [2023-11-29 05:05:55,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:55,817 INFO L495 AbstractCegarLoop]: Abstraction has 887 states and 952 transitions. [2023-11-29 05:05:55,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.214285714285714) internal successors, (129), 17 states have internal predecessors, (129), 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 05:05:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 952 transitions. [2023-11-29 05:05:55,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 05:05:55,818 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:55,818 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:05:55,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-11-29 05:05:56,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (40)] Ended with exit code 0 [2023-11-29 05:05:56,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 05:05:56,219 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:05:56,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:56,219 INFO L85 PathProgramCache]: Analyzing trace with hash 324005084, now seen corresponding path program 1 times [2023-11-29 05:05:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:05:56,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514013463] [2023-11-29 05:05:56,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:56,220 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 05:05:56,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:05:56,221 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 05:05:56,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (42)] Waiting until timeout for monitored process [2023-11-29 05:05:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:57,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 05:05:57,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:05:57,188 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 05:05:57,310 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:05:57,310 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 05:05:57,339 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 05:05:57,437 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 05:05:58,253 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:05:58,254 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 05:05:58,351 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:05:58,352 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 05:05:58,433 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:05:58,434 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 05:05:58,520 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:05:58,520 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 05:05:58,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 05:05:58,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 05:05:58,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:06:02,692 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8409 (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_8409) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 05:06:02,900 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8407 (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~mem40#1.base| v_ArrVal_8407))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8408)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8409)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:06:02,920 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8407))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8408)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8409)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:06:03,321 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8408 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8455 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8455))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8407)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8408)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8409)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:06:03,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:06:03,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514013463] [2023-11-29 05:06:03,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514013463] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:06:03,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [186266197] [2023-11-29 05:06:03,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:06:03,326 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:06:03,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:06:03,327 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:06:03,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-11-29 05:06:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:06:46,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 05:06:46,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:06:46,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 05:06:46,630 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:06:46,631 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 05:06:46,703 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 05:06:46,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 05:06:47,679 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:06:47,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:06:47,877 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:06:47,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:06:47,986 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:06:47,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:06:48,115 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:06:48,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:06:48,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 05:06:48,139 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 05:06:48,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:06:52,227 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8910 (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~mem41#1.base| v_ArrVal_8910))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8409)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:06:52,241 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8910))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8409)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:06:52,259 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8909 (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~mem40#1.base| v_ArrVal_8909))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8910)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8409)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:06:52,278 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8909 (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_8909))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8910)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8409)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:06:52,657 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8910 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8909 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8957))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8909)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8910)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8409)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:06:52,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [186266197] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:06:52,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:06:52,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 05:06:52,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179864277] [2023-11-29 05:06:52,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:06:52,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 05:06:52,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:06:52,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 05:06:52,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=446, Unknown=16, NotChecked=468, Total=1056 [2023-11-29 05:06:52,664 INFO L87 Difference]: Start difference. First operand 887 states and 952 transitions. Second operand has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 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 05:07:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:01,215 INFO L93 Difference]: Finished difference Result 1222 states and 1312 transitions. [2023-11-29 05:07:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:07:01,216 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 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 115 [2023-11-29 05:07:01,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:01,218 INFO L225 Difference]: With dead ends: 1222 [2023-11-29 05:07:01,218 INFO L226 Difference]: Without dead ends: 1222 [2023-11-29 05:07:01,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 213 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=136, Invalid=484, Unknown=16, NotChecked=486, Total=1122 [2023-11-29 05:07:01,219 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 1187 mSDsluCounter, 2764 mSDsCounter, 0 mSdLazyCounter, 3613 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 3131 SdHoareTripleChecker+Invalid, 3625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:01,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 3131 Invalid, 3625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3613 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-11-29 05:07:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2023-11-29 05:07:01,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 886. [2023-11-29 05:07:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 565 states have (on average 1.6601769911504425) internal successors, (938), 876 states have internal predecessors, (938), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 05:07:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 951 transitions. [2023-11-29 05:07:01,227 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 951 transitions. Word has length 115 [2023-11-29 05:07:01,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:01,227 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 951 transitions. [2023-11-29 05:07:01,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 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 05:07:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 951 transitions. [2023-11-29 05:07:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-29 05:07:01,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:01,228 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:01,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (42)] Ended with exit code 0 [2023-11-29 05:07:01,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (43)] Ended with exit code 0 [2023-11-29 05:07:01,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:07:01,629 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:07:01,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:01,629 INFO L85 PathProgramCache]: Analyzing trace with hash 324005085, now seen corresponding path program 1 times [2023-11-29 05:07:01,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:01,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704665608] [2023-11-29 05:07:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:01,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:07:01,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:01,631 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 05:07:01,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (44)] Waiting until timeout for monitored process [2023-11-29 05:07:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:02,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 05:07:02,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:02,837 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 05:07:02,959 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:07:02,959 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 05:07:02,965 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 05:07:03,000 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 05:07:03,005 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 05:07:03,116 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 05:07:03,120 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 05:07:03,807 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:07:03,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 05:07:03,812 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 05:07:03,927 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:07:03,928 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 05:07:03,936 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 05:07:04,033 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:07:04,034 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 05:07:04,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 05:07:04,147 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:07:04,147 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 05:07:04,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 05:07:04,175 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 05:07:04,183 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 05:07:04,214 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 05:07:04,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:07:04,388 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9460 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9461) |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~mem42#1.base| v_ArrVal_9460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:07:04,419 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_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9460 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9461) |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_9460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9461) |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 05:07:04,458 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9459))) (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~mem41#1.base| v_ArrVal_9458) .cse0 v_ArrVal_9461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9458) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9461) |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 05:07:04,501 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_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9458) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9458 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9459))) (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_9458) .cse3 v_ArrVal_9461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 05:07:04,570 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9456 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9457))) (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~mem40#1.base| v_ArrVal_9456) .cse1 v_ArrVal_9458) (select (select (store .cse2 .cse1 v_ArrVal_9459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9461))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9456 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9457))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9459))) (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~mem40#1.base| v_ArrVal_9456) .cse4 v_ArrVal_9458) .cse5 v_ArrVal_9461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 05:07:04,631 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9456 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9457))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9459))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9456) .cse1 v_ArrVal_9458) .cse2 v_ArrVal_9461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9456 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9457))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9456) .cse7 v_ArrVal_9458) (select (select (store .cse8 .cse7 v_ArrVal_9459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9461))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 05:07:10,367 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9553))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9457))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9552) .cse1 v_ArrVal_9456) .cse2 v_ArrVal_9458) (select (select (store .cse3 .cse2 v_ArrVal_9459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9461))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9552 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9459 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9553 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9553))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9457))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9459))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9552) .cse6 v_ArrVal_9456) .cse7 v_ArrVal_9458) .cse8 v_ArrVal_9461) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 05:07:10,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:10,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704665608] [2023-11-29 05:07:10,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704665608] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:07:10,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [694671713] [2023-11-29 05:07:10,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:10,413 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:07:10,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:07:10,413 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:07:10,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2023-11-29 05:07:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:52,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 05:07:52,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:52,453 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 05:07:54,989 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 05:07:55,116 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:07:55,116 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 05:07:55,538 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 05:07:55,608 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 05:07:56,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 05:07:56,827 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 05:08:01,325 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:08:01,326 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 05:08:01,396 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 05:08:02,494 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:08:02,495 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 05:08:02,566 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 05:08:03,314 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:08:03,315 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 05:08:03,363 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 05:08:04,124 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:08:04,124 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 05:08:04,150 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 05:08:04,249 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 05:08:04,296 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 05:08:04,320 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 05:08:04,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:08:04,529 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10057 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10057 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10057) |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~mem42#1.base| v_ArrVal_10056) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:08:04,645 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_10056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10057 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_10057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_10056) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10057 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_10057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2023-11-29 05:08:04,882 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10057 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10055))) (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~mem41#1.base| v_ArrVal_10054) .cse0 v_ArrVal_10057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10056) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10057 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10054) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10055) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10057) |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 05:08:05,159 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10057 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_10055))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_10054) .cse1 v_ArrVal_10057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10056) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10057 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_10054) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_10055) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-29 05:08:06,829 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10057 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10053))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10055))) (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~mem40#1.base| v_ArrVal_10052) .cse0 v_ArrVal_10054) .cse1 v_ArrVal_10057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10056) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10057 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10053))) (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~mem40#1.base| v_ArrVal_10052) .cse6 v_ArrVal_10054) (select (select (store .cse7 .cse6 v_ArrVal_10055) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10057))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 05:08:22,671 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10149 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10149))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10053))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10148) .cse1 v_ArrVal_10052) .cse2 v_ArrVal_10054) (select (select (store .cse3 .cse2 v_ArrVal_10055) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10057))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10149 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10149))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_10053))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_10055))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10148) .cse6 v_ArrVal_10052) .cse7 v_ArrVal_10054) .cse8 v_ArrVal_10057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_10056) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 05:08:22,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [694671713] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:08:22,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:08:22,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 05:08:22,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929166145] [2023-11-29 05:08:22,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:08:22,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 05:08:22,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:08:22,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 05:08:22,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=390, Unknown=16, NotChecked=676, Total=1190 [2023-11-29 05:08:22,713 INFO L87 Difference]: Start difference. First operand 886 states and 951 transitions. Second operand has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 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 05:09:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:09:10,906 INFO L93 Difference]: Finished difference Result 1221 states and 1311 transitions. [2023-11-29 05:09:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:09:10,908 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 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 115 [2023-11-29 05:09:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:09:10,910 INFO L225 Difference]: With dead ends: 1221 [2023-11-29 05:09:10,911 INFO L226 Difference]: Without dead ends: 1221 [2023-11-29 05:09:10,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=177, Invalid=671, Unknown=16, NotChecked=858, Total=1722 [2023-11-29 05:09:10,912 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 1204 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 3310 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:09:10,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 1577 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3310 Invalid, 0 Unknown, 0 Unchecked, 46.1s Time] [2023-11-29 05:09:10,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2023-11-29 05:09:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 885. [2023-11-29 05:09:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 565 states have (on average 1.6584070796460177) internal successors, (937), 875 states have internal predecessors, (937), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 05:09:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 950 transitions. [2023-11-29 05:09:10,922 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 950 transitions. Word has length 115 [2023-11-29 05:09:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:09:10,922 INFO L495 AbstractCegarLoop]: Abstraction has 885 states and 950 transitions. [2023-11-29 05:09:10,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.3125) internal successors, (133), 19 states have internal predecessors, (133), 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 05:09:10,922 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 950 transitions. [2023-11-29 05:09:10,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-29 05:09:10,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:09:10,923 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:09:10,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (44)] Ended with exit code 0 [2023-11-29 05:09:11,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (45)] Ended with exit code 0 [2023-11-29 05:09:11,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:09:11,324 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:09:11,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:11,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2132614435, now seen corresponding path program 1 times [2023-11-29 05:09:11,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:09:11,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512060534] [2023-11-29 05:09:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:11,325 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 05:09:11,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:09:11,326 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 05:09:11,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (46)] Waiting until timeout for monitored process [2023-11-29 05:09:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:12,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 05:09:12,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:09:12,877 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 05:09:14,380 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:09:14,381 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 05:09:14,666 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 05:09:15,281 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 05:09:21,403 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:09:21,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:09:22,253 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:09:22,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 44 treesize of output 43 [2023-11-29 05:09:22,860 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:09:22,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 05:09:23,488 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:09:23,489 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 05:09:24,155 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:09:24,155 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 05:09:24,237 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 05:09:24,539 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 05:09:24,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2023-11-29 05:09:24,931 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 05:09:24,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:09:25,627 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10622 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10622) |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 05:09:25,695 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10622 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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_10622) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:09:25,765 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10622 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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~mem42#1.base| v_ArrVal_10621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:09:25,841 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10622 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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_10621))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 05:09:25,917 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10622 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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~mem41#1.base| v_ArrVal_10620))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10621)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:09:25,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10622 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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_10620))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10621)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:09:26,074 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10622 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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~mem40#1.base| v_ArrVal_10619))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10620)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10621)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:09:26,158 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10622 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10619))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10620)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10621)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:09:27,835 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10669 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10669))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10619)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10620)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10621)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10622)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:09:27,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:09:27,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512060534] [2023-11-29 05:09:27,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512060534] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:09:27,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1859740599] [2023-11-29 05:09:27,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:27,852 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:09:27,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:09:27,853 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:09:27,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process [2023-11-29 05:09:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:39,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-29 05:09:39,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:09:39,688 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 05:09:42,689 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:09:42,690 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 05:09:43,286 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 05:09:44,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 05:09:53,970 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:09:53,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:09:56,045 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:09:56,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:09:57,004 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:09:57,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:09:57,969 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:09:57,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:09:58,921 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:09:58,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 05:09:59,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 05:09:59,515 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 05:09:59,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 05:09:59,793 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 05:09:59,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:10:04,270 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11142 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_11142) |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 05:10:04,340 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11142 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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_11142) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:10:04,414 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11142 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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~mem42#1.base| v_ArrVal_11141))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11142)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:10:04,501 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11142 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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_11141))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11142)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:10:04,587 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11140 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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~mem41#1.base| v_ArrVal_11140))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11141)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11142)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:10:04,664 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11140 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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_11140))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11141)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11142)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:10:04,744 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11140 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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~mem40#1.base| v_ArrVal_11139))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11140)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11141)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11142)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:10:04,830 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11140 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (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| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11139))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11140)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11141)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11142)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:10:07,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1859740599] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:10:07,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:10:07,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-29 05:10:07,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321870330] [2023-11-29 05:10:07,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:10:07,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 05:10:07,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:10:07,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 05:10:07,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=554, Unknown=17, NotChecked=1088, Total=1806 [2023-11-29 05:10:07,233 INFO L87 Difference]: Start difference. First operand 885 states and 950 transitions. Second operand has 23 states, 20 states have (on average 7.05) internal successors, (141), 23 states have internal predecessors, (141), 2 states have call successors, (2), 1 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 05:11:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:11:36,336 INFO L93 Difference]: Finished difference Result 1220 states and 1310 transitions. [2023-11-29 05:11:36,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:11:36,340 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.05) internal successors, (141), 23 states have internal predecessors, (141), 2 states have call successors, (2), 1 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 117 [2023-11-29 05:11:36,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:11:36,342 INFO L225 Difference]: With dead ends: 1220 [2023-11-29 05:11:36,343 INFO L226 Difference]: Without dead ends: 1220 [2023-11-29 05:11:36,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 210 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=156, Invalid=597, Unknown=17, NotChecked=1122, Total=1892 [2023-11-29 05:11:36,344 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 1174 mSDsluCounter, 4162 mSDsCounter, 0 mSdLazyCounter, 5330 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 5342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 88.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:11:36,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 4527 Invalid, 5342 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 5330 Invalid, 0 Unknown, 0 Unchecked, 88.4s Time] [2023-11-29 05:11:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2023-11-29 05:11:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 884. [2023-11-29 05:11:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 565 states have (on average 1.656637168141593) internal successors, (936), 874 states have internal predecessors, (936), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-29 05:11:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 949 transitions. [2023-11-29 05:11:36,363 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 949 transitions. Word has length 117 [2023-11-29 05:11:36,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:11:36,364 INFO L495 AbstractCegarLoop]: Abstraction has 884 states and 949 transitions. [2023-11-29 05:11:36,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.05) internal successors, (141), 23 states have internal predecessors, (141), 2 states have call successors, (2), 1 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 05:11:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 949 transitions. [2023-11-29 05:11:36,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-29 05:11:36,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:11:36,365 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:36,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (46)] Ended with exit code 0 [2023-11-29 05:11:36,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (47)] Ended with exit code 0 [2023-11-29 05:11:36,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:11:36,766 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 528 more)] === [2023-11-29 05:11:36,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:36,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2132614436, now seen corresponding path program 1 times [2023-11-29 05:11:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:11:36,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716161539] [2023-11-29 05:11:36,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:36,768 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 05:11:36,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:11:36,769 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 05:11:36,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/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 (48)] Waiting until timeout for monitored process [2023-11-29 05:11:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:38,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-29 05:11:38,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:11:38,546 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 05:11:40,473 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:11:40,473 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 05:11:40,602 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 05:11:41,057 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 05:11:41,094 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 05:11:42,302 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 17 [2023-11-29 05:11:42,341 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 05:11:54,188 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:11:54,188 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 75 treesize of output 68 [2023-11-29 05:11:54,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 05:11:55,469 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:11:55,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 75 treesize of output 68 [2023-11-29 05:11:55,508 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 05:11:56,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:11:56,489 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 75 treesize of output 68 [2023-11-29 05:11:56,625 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 05:11:57,598 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:11:57,599 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 75 treesize of output 68 [2023-11-29 05:11:57,637 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 05:11:58,653 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:11:58,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2023-11-29 05:11:58,792 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 05:11:58,915 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 44 treesize of output 20 [2023-11-29 05:11:58,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:11:58,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 05:11:59,037 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 05:11:59,356 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 05:11:59,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 05:11:59,689 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 05:11:59,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:12:03,473 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_11712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11713 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11714 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_11712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11714) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_11713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_11712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))))))) is different from false [2023-11-29 05:12:03,690 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11711) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11710) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_11712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11711 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11714 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11710))) (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~mem42#1.base| v_ArrVal_11711) .cse2 v_ArrVal_11712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11714) (select (select (store .cse3 .cse2 v_ArrVal_11713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 05:12:03,952 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_11712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11711 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11714 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_11710))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_11711) .cse1 v_ArrVal_11712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11714) (select (select (store .cse3 .cse1 v_ArrVal_11713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_11711) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_11710) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))))))) is different from false [2023-11-29 05:12:04,180 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_11709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11711 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11709))) (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~mem41#1.base| v_ArrVal_11708) .cse1 v_ArrVal_11711) (select (select (store .cse2 .cse1 v_ArrVal_11710) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11712))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_11709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11711 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11714 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11709))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_11710))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11708) .cse4 v_ArrVal_11711) .cse5 v_ArrVal_11712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11714) (select (select (store .cse6 .cse5 v_ArrVal_11713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 05:12:09,286 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11711 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11706 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11714 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11706))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11709))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11710))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11707) .cse0 v_ArrVal_11708) .cse1 v_ArrVal_11711) .cse2 v_ArrVal_11712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11714) (select (select (store .cse4 .cse2 v_ArrVal_11713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11706 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11706))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11709))) (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~mem40#1.base| v_ArrVal_11707) .cse8 v_ArrVal_11708) .cse9 v_ArrVal_11711) (select (select (store .cse10 .cse9 v_ArrVal_11710) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11712))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd (_ bv4 32) .cse7))))))) is different from false [2023-11-29 05:12:09,664 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (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|) .cse4))) (and (forall ((v_ArrVal_11709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11711 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11706 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11714 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_11706))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_11709))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_11710))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_11707) .cse1 v_ArrVal_11708) .cse2 v_ArrVal_11711) .cse3 v_ArrVal_11712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11714) (select (select (store .cse5 .cse3 v_ArrVal_11713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11706 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_11706))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_11709))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_11707) .cse9 v_ArrVal_11708) .cse10 v_ArrVal_11711) (select (select (store .cse11 .cse10 v_ArrVal_11710) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11712))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse8 (bvadd (_ bv4 32) .cse8)))))))) is different from false [2023-11-29 05:12:14,080 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11706 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11805))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_11706))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_11709))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11806) .cse1 v_ArrVal_11707) .cse2 v_ArrVal_11708) .cse3 v_ArrVal_11711) (select (select (store .cse4 .cse3 v_ArrVal_11710) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11712))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_11709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11711 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11805 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11706 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11714 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11805))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_11706))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_11709))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_11710))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11806) .cse8 v_ArrVal_11707) .cse9 v_ArrVal_11708) .cse10 v_ArrVal_11711) .cse11 v_ArrVal_11712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11714) (select (select (store .cse12 .cse11 v_ArrVal_11713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 05:12:14,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:12:14,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716161539] [2023-11-29 05:12:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716161539] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:12:14,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [715723913] [2023-11-29 05:12:14,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:14,136 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:12:14,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:12:14,138 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:12:14,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb8e8b80-4b46-445e-884f-65c978f45391/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process