./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:53:34,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:53:34,072 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:53:34,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:53:34,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:53:34,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:53:34,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:53:34,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:53:34,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:53:34,103 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:53:34,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:53:34,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:53:34,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:53:34,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:53:34,106 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:53:34,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:53:34,107 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:53:34,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:53:34,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:53:34,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:53:34,109 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:53:34,113 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:53:34,113 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:53:34,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:53:34,114 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:53:34,115 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:53:34,115 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:53:34,115 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:53:34,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:53:34,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:53:34,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:53:34,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:53:34,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:53:34,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:53:34,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:53:34,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:53:34,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:53:34,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:53:34,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:53:34,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:53:34,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:53:34,120 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_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2023-11-29 02:53:34,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:53:34,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:53:34,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:53:34,365 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:53:34,365 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:53:34,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i [2023-11-29 02:53:37,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:53:37,398 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:53:37,398 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i [2023-11-29 02:53:37,417 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/data/0e3e7723a/6f6a687496994cd6a58e43193908ebf5/FLAGc8c335d06 [2023-11-29 02:53:37,433 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/data/0e3e7723a/6f6a687496994cd6a58e43193908ebf5 [2023-11-29 02:53:37,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:53:37,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:53:37,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:53:37,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:53:37,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:53:37,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:53:37" (1/1) ... [2023-11-29 02:53:37,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b719358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:37, skipping insertion in model container [2023-11-29 02:53:37,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:53:37" (1/1) ... [2023-11-29 02:53:37,502 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:53:37,988 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:53:38,000 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 02:53:38,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@20df3781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:38, skipping insertion in model container [2023-11-29 02:53:38,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:53:38,001 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 02:53:38,003 INFO L158 Benchmark]: Toolchain (without parser) took 564.15ms. Allocated memory is still 113.2MB. Free memory was 67.8MB in the beginning and 50.3MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 02:53:38,003 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:53:38,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.53ms. Allocated memory is still 113.2MB. Free memory was 67.5MB in the beginning and 50.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 02:53:38,005 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.18ms. Allocated memory is still 113.2MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.53ms. Allocated memory is still 113.2MB. Free memory was 67.5MB in the beginning and 50.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 738]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:53:39,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:53:39,915 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 02:53:39,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:53:39,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:53:39,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:53:39,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:53:39,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:53:39,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:53:39,960 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:53:39,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:53:39,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:53:39,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:53:39,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:53:39,963 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:53:39,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:53:39,964 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:53:39,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:53:39,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:53:39,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:53:39,966 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:53:39,967 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:53:39,968 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:53:39,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:53:39,969 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:53:39,969 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:53:39,969 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:53:39,970 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:53:39,970 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:53:39,971 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:53:39,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:53:39,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:53:39,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:53:39,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:53:39,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:53:39,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:53:39,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:53:39,973 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:53:39,974 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:53:39,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:53:39,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:53:39,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:53:39,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:53:39,975 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:53:39,975 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_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2023-11-29 02:53:40,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:53:40,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:53:40,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:53:40,298 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:53:40,299 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:53:40,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i [2023-11-29 02:53:43,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:53:43,436 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:53:43,437 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-2.i [2023-11-29 02:53:43,458 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/data/55306b427/d938da51e29042b084e4c8eb40e53390/FLAGb205d0e75 [2023-11-29 02:53:43,476 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/data/55306b427/d938da51e29042b084e4c8eb40e53390 [2023-11-29 02:53:43,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:53:43,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:53:43,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:53:43,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:53:43,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:53:43,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:53:43" (1/1) ... [2023-11-29 02:53:43,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190b11de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:43, skipping insertion in model container [2023-11-29 02:53:43,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:53:43" (1/1) ... [2023-11-29 02:53:43,577 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:53:44,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:53:44,141 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 02:53:44,153 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:53:44,221 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:53:44,226 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:53:44,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:53:44,331 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:53:44,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44 WrapperNode [2023-11-29 02:53:44,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:53:44,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:53:44,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:53:44,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:53:44,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44" (1/1) ... [2023-11-29 02:53:44,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44" (1/1) ... [2023-11-29 02:53:44,428 INFO L138 Inliner]: procedures = 180, calls = 228, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 758 [2023-11-29 02:53:44,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:53:44,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:53:44,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:53:44,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:53:44,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44" (1/1) ... [2023-11-29 02:53:44,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44" (1/1) ... [2023-11-29 02:53:44,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44" (1/1) ... [2023-11-29 02:53:44,513 INFO L175 MemorySlicer]: Split 211 memory accesses to 3 slices as follows [2, 5, 204]. 97 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 51 writes are split as follows [0, 1, 50]. [2023-11-29 02:53:44,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44" (1/1) ... [2023-11-29 02:53:44,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44" (1/1) ... [2023-11-29 02:53:44,546 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44" (1/1) ... [2023-11-29 02:53:44,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44" (1/1) ... [2023-11-29 02:53:44,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44" (1/1) ... [2023-11-29 02:53:44,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44" (1/1) ... [2023-11-29 02:53:44,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:53:44,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:53:44,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:53:44,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:53:44,575 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44" (1/1) ... [2023-11-29 02:53:44,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:53:44,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:53:44,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:53:44,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:53:44,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 02:53:44,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 02:53:44,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 02:53:44,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 02:53:44,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 02:53:44,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 02:53:44,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 02:53:44,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 02:53:44,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 02:53:44,644 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 02:53:44,645 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 02:53:44,645 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 02:53:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:53:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:53:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:53:44,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:53:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:53:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 02:53:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:53:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:53:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 02:53:44,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:53:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 02:53:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 02:53:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 02:53:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:53:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 02:53:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 02:53:44,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:53:44,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:53:44,876 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:53:44,878 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:53:44,882 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:53:44,936 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:53:44,958 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:53:48,354 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:53:48,527 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:53:48,527 INFO L309 CfgBuilder]: Removed 40 assume(true) statements. [2023-11-29 02:53:48,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:53:48 BoogieIcfgContainer [2023-11-29 02:53:48,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:53:48,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:53:48,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:53:48,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:53:48,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:53:43" (1/3) ... [2023-11-29 02:53:48,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d330df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:53:48, skipping insertion in model container [2023-11-29 02:53:48,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44" (2/3) ... [2023-11-29 02:53:48,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d330df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:53:48, skipping insertion in model container [2023-11-29 02:53:48,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:53:48" (3/3) ... [2023-11-29 02:53:48,538 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test1-2.i [2023-11-29 02:53:48,558 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:53:48,558 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 435 error locations. [2023-11-29 02:53:48,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:53:48,626 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;@2104e2d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:53:48,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 435 error locations. [2023-11-29 02:53:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 767 states, 330 states have (on average 2.5606060606060606) internal successors, (845), 762 states have internal predecessors, (845), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:53:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 02:53:48,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:48,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 02:53:48,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:53:48,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:48,646 INFO L85 PathProgramCache]: Analyzing trace with hash 39360962, now seen corresponding path program 1 times [2023-11-29 02:53:48,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:48,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743145013] [2023-11-29 02:53:48,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:48,681 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 02:53:48,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:48,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:48,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:48,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 02:53:48,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:48,913 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 02:53:48,913 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:48,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:48,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743145013] [2023-11-29 02:53:48,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743145013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:48,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:48,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:53:48,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120157799] [2023-11-29 02:53:48,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:48,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:53:48,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:48,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:53:48,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:53:48,954 INFO L87 Difference]: Start difference. First operand has 767 states, 330 states have (on average 2.5606060606060606) internal successors, (845), 762 states have internal predecessors, (845), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 02:53:49,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:49,505 INFO L93 Difference]: Finished difference Result 757 states and 795 transitions. [2023-11-29 02:53:49,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:53:49,509 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2023-11-29 02:53:49,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:49,522 INFO L225 Difference]: With dead ends: 757 [2023-11-29 02:53:49,522 INFO L226 Difference]: Without dead ends: 756 [2023-11-29 02:53:49,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:53:49,527 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:49,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 709 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 02:53:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2023-11-29 02:53:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2023-11-29 02:53:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 325 states have (on average 2.4246153846153846) internal successors, (788), 751 states have internal predecessors, (788), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:53:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 794 transitions. [2023-11-29 02:53:49,601 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 794 transitions. Word has length 4 [2023-11-29 02:53:49,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:49,601 INFO L495 AbstractCegarLoop]: Abstraction has 756 states and 794 transitions. [2023-11-29 02:53:49,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 02:53:49,601 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 794 transitions. [2023-11-29 02:53:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 02:53:49,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:49,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 02:53:49,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:49,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:49,803 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:53:49,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:49,804 INFO L85 PathProgramCache]: Analyzing trace with hash 39361024, now seen corresponding path program 1 times [2023-11-29 02:53:49,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:49,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949762938] [2023-11-29 02:53:49,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:49,805 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 02:53:49,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:49,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:49,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:49,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:53:49,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:49,960 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 02:53:49,983 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 02:53:49,983 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:49,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:49,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949762938] [2023-11-29 02:53:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949762938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:49,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:49,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:53:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506787606] [2023-11-29 02:53:49,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:50,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:53:50,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:50,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:53:50,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:53:50,004 INFO L87 Difference]: Start difference. First operand 756 states and 794 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 02:53:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:51,492 INFO L93 Difference]: Finished difference Result 717 states and 756 transitions. [2023-11-29 02:53:51,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:53:51,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2023-11-29 02:53:51,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:51,499 INFO L225 Difference]: With dead ends: 717 [2023-11-29 02:53:51,499 INFO L226 Difference]: Without dead ends: 717 [2023-11-29 02:53:51,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 02:53:51,501 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 515 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:51,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 507 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 02:53:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2023-11-29 02:53:51,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 707. [2023-11-29 02:53:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 325 states have (on average 2.273846153846154) internal successors, (739), 702 states have internal predecessors, (739), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:53:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 745 transitions. [2023-11-29 02:53:51,549 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 745 transitions. Word has length 4 [2023-11-29 02:53:51,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:51,550 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 745 transitions. [2023-11-29 02:53:51,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 02:53:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 745 transitions. [2023-11-29 02:53:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 02:53:51,550 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:51,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 02:53:51,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:51,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:51,751 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:53:51,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:51,752 INFO L85 PathProgramCache]: Analyzing trace with hash 39361025, now seen corresponding path program 1 times [2023-11-29 02:53:51,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:51,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581982336] [2023-11-29 02:53:51,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:51,753 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 02:53:51,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:51,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:51,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:51,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:53:51,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:51,846 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 02:53:51,866 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 02:53:51,866 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:51,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:51,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581982336] [2023-11-29 02:53:51,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581982336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:51,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:51,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:53:51,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543227830] [2023-11-29 02:53:51,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:51,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:53:51,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:51,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:53:51,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:53:51,869 INFO L87 Difference]: Start difference. First operand 707 states and 745 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 02:53:53,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:53,787 INFO L93 Difference]: Finished difference Result 766 states and 808 transitions. [2023-11-29 02:53:53,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:53:53,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2023-11-29 02:53:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:53,794 INFO L225 Difference]: With dead ends: 766 [2023-11-29 02:53:53,794 INFO L226 Difference]: Without dead ends: 766 [2023-11-29 02:53:53,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 02:53:53,795 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 231 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:53,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 790 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 02:53:53,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2023-11-29 02:53:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 719. [2023-11-29 02:53:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 348 states have (on average 2.2557471264367814) internal successors, (785), 714 states have internal predecessors, (785), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:53:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 791 transitions. [2023-11-29 02:53:53,820 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 791 transitions. Word has length 4 [2023-11-29 02:53:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:53,820 INFO L495 AbstractCegarLoop]: Abstraction has 719 states and 791 transitions. [2023-11-29 02:53:53,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 02:53:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 791 transitions. [2023-11-29 02:53:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 02:53:53,821 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:53,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:53:53,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:54,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:54,022 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:53:54,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1221020111, now seen corresponding path program 1 times [2023-11-29 02:53:54,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:54,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414610965] [2023-11-29 02:53:54,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:54,024 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 02:53:54,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:54,025 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:54,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:54,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:53:54,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:54,100 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 02:53:54,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:54,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:54,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414610965] [2023-11-29 02:53:54,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414610965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:54,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:54,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:53:54,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768939948] [2023-11-29 02:53:54,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:54,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:53:54,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:54,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:53:54,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:53:54,102 INFO L87 Difference]: Start difference. First operand 719 states and 791 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:53:55,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:55,013 INFO L93 Difference]: Finished difference Result 1236 states and 1368 transitions. [2023-11-29 02:53:55,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:53:55,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 02:53:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:55,020 INFO L225 Difference]: With dead ends: 1236 [2023-11-29 02:53:55,020 INFO L226 Difference]: Without dead ends: 1236 [2023-11-29 02:53:55,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:53:55,022 INFO L413 NwaCegarLoop]: 826 mSDtfsCounter, 513 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:55,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1472 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:53:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2023-11-29 02:53:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 720. [2023-11-29 02:53:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 349 states have (on average 2.2521489971346704) internal successors, (786), 715 states have internal predecessors, (786), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:53:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 792 transitions. [2023-11-29 02:53:55,041 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 792 transitions. Word has length 5 [2023-11-29 02:53:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:55,041 INFO L495 AbstractCegarLoop]: Abstraction has 720 states and 792 transitions. [2023-11-29 02:53:55,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:53:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 792 transitions. [2023-11-29 02:53:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:53:55,042 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:55,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:53:55,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 02:53:55,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:55,243 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:53:55,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash 920420610, now seen corresponding path program 1 times [2023-11-29 02:53:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:55,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548188834] [2023-11-29 02:53:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:55,245 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 02:53:55,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:55,246 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:55,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:55,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:53:55,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:55,404 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 02:53:55,404 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:55,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:55,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548188834] [2023-11-29 02:53:55,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548188834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:55,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:55,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:53:55,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766612275] [2023-11-29 02:53:55,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:55,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:53:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:55,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:53:55,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:53:55,407 INFO L87 Difference]: Start difference. First operand 720 states and 792 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:53:56,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:56,178 INFO L93 Difference]: Finished difference Result 681 states and 752 transitions. [2023-11-29 02:53:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:53:56,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 02:53:56,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:56,183 INFO L225 Difference]: With dead ends: 681 [2023-11-29 02:53:56,183 INFO L226 Difference]: Without dead ends: 681 [2023-11-29 02:53:56,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:53:56,184 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 70 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:56,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1151 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:53:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-11-29 02:53:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2023-11-29 02:53:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 334 states have (on average 2.2335329341317367) internal successors, (746), 676 states have internal predecessors, (746), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:53:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 752 transitions. [2023-11-29 02:53:56,200 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 752 transitions. Word has length 11 [2023-11-29 02:53:56,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:56,201 INFO L495 AbstractCegarLoop]: Abstraction has 681 states and 752 transitions. [2023-11-29 02:53:56,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:53:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 752 transitions. [2023-11-29 02:53:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 02:53:56,202 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:56,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:53:56,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:56,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:56,405 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:53:56,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:56,405 INFO L85 PathProgramCache]: Analyzing trace with hash -239060164, now seen corresponding path program 1 times [2023-11-29 02:53:56,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:56,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190309188] [2023-11-29 02:53:56,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:56,406 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 02:53:56,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:56,407 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:56,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:56,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:53:56,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:56,563 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 02:53:56,563 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:56,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:56,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190309188] [2023-11-29 02:53:56,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190309188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:56,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:56,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:53:56,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968901181] [2023-11-29 02:53:56,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:56,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:53:56,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:56,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:53:56,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:53:56,566 INFO L87 Difference]: Start difference. First operand 681 states and 752 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:53:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:57,332 INFO L93 Difference]: Finished difference Result 667 states and 731 transitions. [2023-11-29 02:53:57,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:53:57,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 02:53:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:57,336 INFO L225 Difference]: With dead ends: 667 [2023-11-29 02:53:57,337 INFO L226 Difference]: Without dead ends: 667 [2023-11-29 02:53:57,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:53:57,337 INFO L413 NwaCegarLoop]: 569 mSDtfsCounter, 58 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:57,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1683 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 02:53:57,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2023-11-29 02:53:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 666. [2023-11-29 02:53:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 333 states have (on average 2.174174174174174) internal successors, (724), 661 states have internal predecessors, (724), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:53:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 730 transitions. [2023-11-29 02:53:57,352 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 730 transitions. Word has length 13 [2023-11-29 02:53:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:57,352 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 730 transitions. [2023-11-29 02:53:57,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:53:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 730 transitions. [2023-11-29 02:53:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 02:53:57,353 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:57,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:53:57,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:57,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:57,554 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:53:57,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:57,555 INFO L85 PathProgramCache]: Analyzing trace with hash -808841014, now seen corresponding path program 1 times [2023-11-29 02:53:57,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:57,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638561361] [2023-11-29 02:53:57,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:57,555 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 02:53:57,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:57,556 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:57,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:57,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:53:57,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:57,686 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 02:53:57,764 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 02:53:57,765 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:57,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:57,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638561361] [2023-11-29 02:53:57,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638561361] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:57,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:57,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:53:57,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344766548] [2023-11-29 02:53:57,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:57,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:53:57,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:57,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:53:57,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:53:57,767 INFO L87 Difference]: Start difference. First operand 666 states and 730 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:53:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:59,451 INFO L93 Difference]: Finished difference Result 672 states and 737 transitions. [2023-11-29 02:53:59,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:53:59,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 02:53:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:59,455 INFO L225 Difference]: With dead ends: 672 [2023-11-29 02:53:59,456 INFO L226 Difference]: Without dead ends: 672 [2023-11-29 02:53:59,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:53:59,457 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 448 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:59,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 713 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 02:53:59,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2023-11-29 02:53:59,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 662. [2023-11-29 02:53:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 333 states have (on average 2.1621621621621623) internal successors, (720), 657 states have internal predecessors, (720), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:53:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 726 transitions. [2023-11-29 02:53:59,473 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 726 transitions. Word has length 27 [2023-11-29 02:53:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:59,473 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 726 transitions. [2023-11-29 02:53:59,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:53:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 726 transitions. [2023-11-29 02:53:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 02:53:59,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:59,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:53:59,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:59,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:59,675 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:53:59,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:59,676 INFO L85 PathProgramCache]: Analyzing trace with hash -808841013, now seen corresponding path program 1 times [2023-11-29 02:53:59,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:59,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588167250] [2023-11-29 02:53:59,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:59,676 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 02:53:59,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:59,677 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:59,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:53:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:53:59,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:59,792 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 02:53:59,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 02:53:59,978 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:59,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:59,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588167250] [2023-11-29 02:53:59,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588167250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:59,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:59,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:53:59,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186597228] [2023-11-29 02:53:59,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:59,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:53:59,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:59,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:53:59,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:53:59,980 INFO L87 Difference]: Start difference. First operand 662 states and 726 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:02,397 INFO L93 Difference]: Finished difference Result 705 states and 739 transitions. [2023-11-29 02:54:02,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:54:02,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 02:54:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:02,402 INFO L225 Difference]: With dead ends: 705 [2023-11-29 02:54:02,402 INFO L226 Difference]: Without dead ends: 705 [2023-11-29 02:54:02,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:54:02,403 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 167 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:02,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1012 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 02:54:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2023-11-29 02:54:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2023-11-29 02:54:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 333 states have (on average 2.15015015015015) internal successors, (716), 653 states have internal predecessors, (716), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:54:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 722 transitions. [2023-11-29 02:54:02,421 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 722 transitions. Word has length 27 [2023-11-29 02:54:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:02,421 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 722 transitions. [2023-11-29 02:54:02,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 722 transitions. [2023-11-29 02:54:02,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 02:54:02,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:02,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:02,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:02,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:02,624 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:54:02,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:02,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1070454460, now seen corresponding path program 1 times [2023-11-29 02:54:02,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:02,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820362973] [2023-11-29 02:54:02,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:02,626 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 02:54:02,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:02,627 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:02,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:02,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:54:02,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:02,828 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 02:54:02,828 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:02,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:02,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820362973] [2023-11-29 02:54:02,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820362973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:02,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:02,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:54:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270292446] [2023-11-29 02:54:02,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:02,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:54:02,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:02,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:54:02,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:54:02,830 INFO L87 Difference]: Start difference. First operand 658 states and 722 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:03,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:03,539 INFO L93 Difference]: Finished difference Result 652 states and 712 transitions. [2023-11-29 02:54:03,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:54:03,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-11-29 02:54:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:03,543 INFO L225 Difference]: With dead ends: 652 [2023-11-29 02:54:03,543 INFO L226 Difference]: Without dead ends: 652 [2023-11-29 02:54:03,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:54:03,544 INFO L413 NwaCegarLoop]: 563 mSDtfsCounter, 23 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:03,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1669 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 02:54:03,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2023-11-29 02:54:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2023-11-29 02:54:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 327 states have (on average 2.159021406727829) internal successors, (706), 647 states have internal predecessors, (706), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:54:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 712 transitions. [2023-11-29 02:54:03,554 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 712 transitions. Word has length 43 [2023-11-29 02:54:03,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:03,554 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 712 transitions. [2023-11-29 02:54:03,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 712 transitions. [2023-11-29 02:54:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 02:54:03,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:03,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:03,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:03,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:03,757 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:54:03,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:03,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1702874395, now seen corresponding path program 1 times [2023-11-29 02:54:03,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:03,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239601875] [2023-11-29 02:54:03,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:03,758 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 02:54:03,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:03,759 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:03,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:03,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:54:03,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:04,185 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 02:54:04,186 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:04,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:04,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239601875] [2023-11-29 02:54:04,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239601875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:04,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:04,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:54:04,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960669934] [2023-11-29 02:54:04,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:04,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:54:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:04,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:54:04,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:54:04,188 INFO L87 Difference]: Start difference. First operand 652 states and 712 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:04,973 INFO L93 Difference]: Finished difference Result 876 states and 945 transitions. [2023-11-29 02:54:04,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:54:04,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-11-29 02:54:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:04,979 INFO L225 Difference]: With dead ends: 876 [2023-11-29 02:54:04,979 INFO L226 Difference]: Without dead ends: 876 [2023-11-29 02:54:04,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:54:04,980 INFO L413 NwaCegarLoop]: 630 mSDtfsCounter, 246 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:04,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1093 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:54:04,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2023-11-29 02:54:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 696. [2023-11-29 02:54:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 371 states have (on average 2.0215633423180592) internal successors, (750), 691 states have internal predecessors, (750), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:54:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 756 transitions. [2023-11-29 02:54:04,993 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 756 transitions. Word has length 47 [2023-11-29 02:54:04,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:04,993 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 756 transitions. [2023-11-29 02:54:04,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 756 transitions. [2023-11-29 02:54:04,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 02:54:04,995 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:04,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:05,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 02:54:05,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:05,199 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:54:05,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:05,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1715140969, now seen corresponding path program 1 times [2023-11-29 02:54:05,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:05,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373932667] [2023-11-29 02:54:05,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:05,200 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 02:54:05,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:05,201 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:05,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:05,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 02:54:05,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:05,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 02:54:05,518 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 02:54:05,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:54:05,997 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 02:54:06,015 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:54:06,016 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 02:54:06,035 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 02:54:06,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:06,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373932667] [2023-11-29 02:54:06,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373932667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:06,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:06,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:54:06,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228174223] [2023-11-29 02:54:06,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:06,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:54:06,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:06,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:54:06,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:54:06,037 INFO L87 Difference]: Start difference. First operand 696 states and 756 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:07,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:07,829 INFO L93 Difference]: Finished difference Result 668 states and 729 transitions. [2023-11-29 02:54:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:54:07,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-29 02:54:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:07,835 INFO L225 Difference]: With dead ends: 668 [2023-11-29 02:54:07,835 INFO L226 Difference]: Without dead ends: 668 [2023-11-29 02:54:07,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:54:07,836 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 354 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:07,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 425 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 02:54:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-11-29 02:54:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 635. [2023-11-29 02:54:07,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 348 states have (on average 1.882183908045977) internal successors, (655), 630 states have internal predecessors, (655), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:54:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 661 transitions. [2023-11-29 02:54:07,849 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 661 transitions. Word has length 50 [2023-11-29 02:54:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:07,850 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 661 transitions. [2023-11-29 02:54:07,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 661 transitions. [2023-11-29 02:54:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 02:54:07,851 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:07,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:07,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 02:54:08,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:08,056 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:54:08,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:08,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1416143778, now seen corresponding path program 1 times [2023-11-29 02:54:08,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:08,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868898868] [2023-11-29 02:54:08,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:08,058 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 02:54:08,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:08,059 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:08,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:54:08,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:08,274 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 02:54:08,292 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 02:54:08,314 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 02:54:08,325 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 02:54:08,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:08,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:08,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868898868] [2023-11-29 02:54:08,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868898868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:08,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:08,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:54:08,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664634594] [2023-11-29 02:54:08,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:08,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:54:08,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:08,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:54:08,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:54:08,328 INFO L87 Difference]: Start difference. First operand 635 states and 661 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:10,409 INFO L93 Difference]: Finished difference Result 634 states and 660 transitions. [2023-11-29 02:54:10,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:54:10,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 02:54:10,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:10,414 INFO L225 Difference]: With dead ends: 634 [2023-11-29 02:54:10,414 INFO L226 Difference]: Without dead ends: 634 [2023-11-29 02:54:10,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:54:10,415 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 3 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:10,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1343 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 02:54:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2023-11-29 02:54:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2023-11-29 02:54:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 348 states have (on average 1.8793103448275863) internal successors, (654), 629 states have internal predecessors, (654), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:54:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 660 transitions. [2023-11-29 02:54:10,424 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 660 transitions. Word has length 54 [2023-11-29 02:54:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:10,425 INFO L495 AbstractCegarLoop]: Abstraction has 634 states and 660 transitions. [2023-11-29 02:54:10,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 660 transitions. [2023-11-29 02:54:10,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 02:54:10,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:10,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:10,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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)] Forceful destruction successful, exit code 0 [2023-11-29 02:54:10,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:10,632 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:54:10,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:10,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1416143777, now seen corresponding path program 1 times [2023-11-29 02:54:10,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:10,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274835794] [2023-11-29 02:54:10,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:10,633 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 02:54:10,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:10,634 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:10,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:10,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 02:54:10,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:10,870 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 02:54:10,895 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 02:54:10,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:54:10,952 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 02:54:10,971 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 02:54:10,971 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:10,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:10,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274835794] [2023-11-29 02:54:10,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274835794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:10,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:10,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:54:10,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109420716] [2023-11-29 02:54:10,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:10,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:54:10,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:10,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:54:10,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:54:10,973 INFO L87 Difference]: Start difference. First operand 634 states and 660 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:13,714 INFO L93 Difference]: Finished difference Result 633 states and 659 transitions. [2023-11-29 02:54:13,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:54:13,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 02:54:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:13,718 INFO L225 Difference]: With dead ends: 633 [2023-11-29 02:54:13,718 INFO L226 Difference]: Without dead ends: 633 [2023-11-29 02:54:13,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 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 02:54:13,719 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 1 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:13,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1369 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 02:54:13,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2023-11-29 02:54:13,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2023-11-29 02:54:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 347 states have (on average 1.8818443804034581) internal successors, (653), 628 states have internal predecessors, (653), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 02:54:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 659 transitions. [2023-11-29 02:54:13,732 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 659 transitions. Word has length 54 [2023-11-29 02:54:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:13,733 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 659 transitions. [2023-11-29 02:54:13,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 659 transitions. [2023-11-29 02:54:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 02:54:13,734 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:13,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:13,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:13,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:13,935 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:54:13,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash -218806942, now seen corresponding path program 1 times [2023-11-29 02:54:13,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:13,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775328060] [2023-11-29 02:54:13,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:13,936 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 02:54:13,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:13,937 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:13,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:54:14,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:14,158 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 02:54:14,159 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:14,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:14,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775328060] [2023-11-29 02:54:14,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775328060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:14,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:14,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:54:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414134218] [2023-11-29 02:54:14,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:14,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:54:14,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:14,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:54:14,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:54:14,161 INFO L87 Difference]: Start difference. First operand 633 states and 659 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:54:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:15,006 INFO L93 Difference]: Finished difference Result 635 states and 662 transitions. [2023-11-29 02:54:15,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:54:15,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2023-11-29 02:54:15,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:15,012 INFO L225 Difference]: With dead ends: 635 [2023-11-29 02:54:15,012 INFO L226 Difference]: Without dead ends: 635 [2023-11-29 02:54:15,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:54:15,013 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 1 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:15,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1608 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:54:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2023-11-29 02:54:15,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2023-11-29 02:54:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 348 states have (on average 1.882183908045977) internal successors, (655), 630 states have internal predecessors, (655), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 02:54:15,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 662 transitions. [2023-11-29 02:54:15,028 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 662 transitions. Word has length 60 [2023-11-29 02:54:15,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:15,028 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 662 transitions. [2023-11-29 02:54:15,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:54:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 662 transitions. [2023-11-29 02:54:15,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 02:54:15,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:15,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:15,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 02:54:15,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:15,230 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:54:15,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:15,231 INFO L85 PathProgramCache]: Analyzing trace with hash 16172231, now seen corresponding path program 1 times [2023-11-29 02:54:15,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:15,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200061989] [2023-11-29 02:54:15,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:15,232 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 02:54:15,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:15,233 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:15,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:15,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:54:15,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:15,491 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 02:54:15,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:54:15,547 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 02:54:15,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:15,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200061989] [2023-11-29 02:54:15,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200061989] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:54:15,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:54:15,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 02:54:15,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891023065] [2023-11-29 02:54:15,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:54:15,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:54:15,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:15,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:54:15,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:54:15,550 INFO L87 Difference]: Start difference. First operand 635 states and 662 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:54:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:16,946 INFO L93 Difference]: Finished difference Result 644 states and 676 transitions. [2023-11-29 02:54:16,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:54:16,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2023-11-29 02:54:16,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:16,950 INFO L225 Difference]: With dead ends: 644 [2023-11-29 02:54:16,950 INFO L226 Difference]: Without dead ends: 644 [2023-11-29 02:54:16,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:54:16,951 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 6 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3206 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:16,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3206 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 02:54:16,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2023-11-29 02:54:16,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 643. [2023-11-29 02:54:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 355 states have (on average 1.8816901408450704) internal successors, (668), 637 states have internal predecessors, (668), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 02:54:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 675 transitions. [2023-11-29 02:54:16,966 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 675 transitions. Word has length 61 [2023-11-29 02:54:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:16,966 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 675 transitions. [2023-11-29 02:54:16,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:54:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 675 transitions. [2023-11-29 02:54:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 02:54:16,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:16,968 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:16,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 02:54:17,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:17,173 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:54:17,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash 655128226, now seen corresponding path program 2 times [2023-11-29 02:54:17,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:17,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943195372] [2023-11-29 02:54:17,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:54:17,174 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 02:54:17,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:17,175 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:17,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:17,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:54:17,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:54:17,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 02:54:17,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:17,596 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 02:54:17,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:54:17,785 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 02:54:17,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:17,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943195372] [2023-11-29 02:54:17,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943195372] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:54:17,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:54:17,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 02:54:17,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28849983] [2023-11-29 02:54:17,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:54:17,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:54:17,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:17,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:54:17,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:54:17,788 INFO L87 Difference]: Start difference. First operand 643 states and 675 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:54:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:19,705 INFO L93 Difference]: Finished difference Result 658 states and 697 transitions. [2023-11-29 02:54:19,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 02:54:19,706 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2023-11-29 02:54:19,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:19,710 INFO L225 Difference]: With dead ends: 658 [2023-11-29 02:54:19,710 INFO L226 Difference]: Without dead ends: 656 [2023-11-29 02:54:19,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 02:54:19,711 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 12 mSDsluCounter, 3208 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3744 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:19,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3744 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 02:54:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-29 02:54:19,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 652. [2023-11-29 02:54:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 364 states have (on average 1.8681318681318682) internal successors, (680), 646 states have internal predecessors, (680), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 02:54:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 687 transitions. [2023-11-29 02:54:19,732 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 687 transitions. Word has length 64 [2023-11-29 02:54:19,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:19,732 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 687 transitions. [2023-11-29 02:54:19,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:54:19,732 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 687 transitions. [2023-11-29 02:54:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 02:54:19,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:19,733 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:19,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 02:54:19,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:19,934 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:54:19,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash 267539586, now seen corresponding path program 3 times [2023-11-29 02:54:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:19,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025588890] [2023-11-29 02:54:19,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 02:54:19,935 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 02:54:19,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:19,936 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:19,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:20,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 02:54:20,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:54:20,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 02:54:20,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:20,665 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 02:54:20,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:54:21,278 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 02:54:21,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:21,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025588890] [2023-11-29 02:54:21,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025588890] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:54:21,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:54:21,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 02:54:21,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922359968] [2023-11-29 02:54:21,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:54:21,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 02:54:21,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:21,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 02:54:21,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:54:21,281 INFO L87 Difference]: Start difference. First operand 652 states and 687 transitions. Second operand has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:54:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:26,946 INFO L93 Difference]: Finished difference Result 682 states and 737 transitions. [2023-11-29 02:54:26,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 02:54:26,947 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2023-11-29 02:54:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:26,950 INFO L225 Difference]: With dead ends: 682 [2023-11-29 02:54:26,950 INFO L226 Difference]: Without dead ends: 679 [2023-11-29 02:54:26,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 02:54:26,951 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 24 mSDsluCounter, 8535 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 9070 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:26,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 9070 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-29 02:54:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2023-11-29 02:54:26,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 670. [2023-11-29 02:54:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 382 states have (on average 1.8403141361256545) internal successors, (703), 664 states have internal predecessors, (703), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 02:54:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 710 transitions. [2023-11-29 02:54:26,964 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 710 transitions. Word has length 70 [2023-11-29 02:54:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:26,965 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 710 transitions. [2023-11-29 02:54:26,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:54:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 710 transitions. [2023-11-29 02:54:26,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 02:54:26,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:26,966 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:26,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 02:54:27,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:27,166 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:54:27,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1940236222, now seen corresponding path program 4 times [2023-11-29 02:54:27,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:27,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827136261] [2023-11-29 02:54:27,167 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 02:54:27,168 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 02:54:27,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:27,168 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:27,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:27,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 02:54:27,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:54:27,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 02:54:27,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:27,852 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 02:54:27,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:54:29,354 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 02:54:29,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:29,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827136261] [2023-11-29 02:54:29,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827136261] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:54:29,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:54:29,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 02:54:29,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136484501] [2023-11-29 02:54:29,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:54:29,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 02:54:29,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:29,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 02:54:29,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 02:54:29,358 INFO L87 Difference]: Start difference. First operand 670 states and 710 transitions. Second operand has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:54:42,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:42,722 INFO L93 Difference]: Finished difference Result 727 states and 799 transitions. [2023-11-29 02:54:42,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 02:54:42,723 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2023-11-29 02:54:42,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:42,727 INFO L225 Difference]: With dead ends: 727 [2023-11-29 02:54:42,728 INFO L226 Difference]: Without dead ends: 725 [2023-11-29 02:54:42,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 02:54:42,732 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 47 mSDsluCounter, 14440 mSDsCounter, 0 mSdLazyCounter, 4505 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 14976 SdHoareTripleChecker+Invalid, 4545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:42,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 14976 Invalid, 4545 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 4505 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2023-11-29 02:54:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2023-11-29 02:54:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 704. [2023-11-29 02:54:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 416 states have (on average 1.8004807692307692) internal successors, (749), 698 states have internal predecessors, (749), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 02:54:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 756 transitions. [2023-11-29 02:54:42,747 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 756 transitions. Word has length 82 [2023-11-29 02:54:42,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:42,748 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 756 transitions. [2023-11-29 02:54:42,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:54:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 756 transitions. [2023-11-29 02:54:42,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 02:54:42,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:42,749 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:42,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 02:54:42,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:42,950 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:54:42,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:42,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1143735074, now seen corresponding path program 5 times [2023-11-29 02:54:42,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:42,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453740389] [2023-11-29 02:54:42,951 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:54:42,951 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 02:54:42,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:42,952 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:42,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:54:44,353 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 02:54:44,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:54:44,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 02:54:44,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:44,402 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:54:44,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-11-29 02:54:44,775 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 02:54:44,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-29 02:54:44,842 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 02:54:45,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2023-11-29 02:54:47,589 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:54:47,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2023-11-29 02:54:47,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 51 treesize of output 27 [2023-11-29 02:54:47,749 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 02:54:47,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:54:52,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:52,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453740389] [2023-11-29 02:54:52,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453740389] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:54:52,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [413351021] [2023-11-29 02:54:52,219 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:54:52,220 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:54:52,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:54:52,221 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:54:52,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-11-29 02:56:02,179 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 02:56:02,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:56:02,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 02:56:02,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:56:02,443 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:56:02,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 02:56:02,998 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 02:56:02,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-11-29 02:56:03,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:56:03,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 02:56:04,925 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:56:04,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:56:05,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 35 treesize of output 19 [2023-11-29 02:56:05,145 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 02:56:05,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:56:09,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [413351021] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:56:09,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:56:09,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-11-29 02:56:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827908878] [2023-11-29 02:56:09,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:56:09,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 02:56:09,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:56:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 02:56:09,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=353, Unknown=2, NotChecked=0, Total=420 [2023-11-29 02:56:09,667 INFO L87 Difference]: Start difference. First operand 704 states and 756 transitions. Second operand has 18 states, 15 states have (on average 8.0) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:56:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:56:19,665 INFO L93 Difference]: Finished difference Result 1310 states and 1408 transitions. [2023-11-29 02:56:19,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 02:56:19,666 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 8.0) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2023-11-29 02:56:19,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:56:19,671 INFO L225 Difference]: With dead ends: 1310 [2023-11-29 02:56:19,671 INFO L226 Difference]: Without dead ends: 1306 [2023-11-29 02:56:19,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 192 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=217, Invalid=1113, Unknown=2, NotChecked=0, Total=1332 [2023-11-29 02:56:19,672 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 2536 mSDsluCounter, 2413 mSDsCounter, 0 mSdLazyCounter, 3604 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2536 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 3663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:56:19,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2536 Valid, 2687 Invalid, 3663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3604 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2023-11-29 02:56:19,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2023-11-29 02:56:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 703. [2023-11-29 02:56:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 416 states have (on average 1.7884615384615385) internal successors, (744), 697 states have internal predecessors, (744), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 02:56:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 751 transitions. [2023-11-29 02:56:19,685 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 751 transitions. Word has length 104 [2023-11-29 02:56:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:56:19,686 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 751 transitions. [2023-11-29 02:56:19,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 8.0) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:56:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 751 transitions. [2023-11-29 02:56:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 02:56:19,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:56:19,687 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:56:19,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2023-11-29 02:56:19,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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)] Forceful destruction successful, exit code 0 [2023-11-29 02:56:20,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:56:20,087 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:56:20,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:56:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1143735075, now seen corresponding path program 1 times [2023-11-29 02:56:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:56:20,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725004980] [2023-11-29 02:56:20,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:56:20,089 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 02:56:20,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:56:20,090 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:56:20,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:56:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:56:20,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 02:56:20,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:56:20,835 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 02:56:21,118 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 02:56:21,134 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:56:21,134 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 02:56:21,162 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 02:56:21,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:56:21,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 18 treesize of output 10 [2023-11-29 02:56:21,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:56:22,063 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:56:22,063 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 02:56:22,073 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 02:56:22,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 25 treesize of output 13 [2023-11-29 02:56:22,139 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 02:56:22,169 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 02:56:22,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:56:23,672 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2630 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2630) |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 02:56:23,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:56:23,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1725004980] [2023-11-29 02:56:23,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1725004980] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:56:23,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [41197745] [2023-11-29 02:56:23,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:56:23,681 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:56:23,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:56:23,682 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:56:23,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 02:58:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:58:04,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 02:58:04,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:58:04,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:58:05,018 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 02:58:05,039 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:58:05,039 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 02:58:05,056 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 02:58:05,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:58:05,127 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 02:58:05,131 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 02:58:05,885 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:58:05,885 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 02:58:05,895 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 02:58:05,952 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 02:58:05,959 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 02:58:05,961 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 02:58:05,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:58:07,324 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3166 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3166 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3166) |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 02:58:07,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [41197745] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:58:07,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:58:07,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 02:58:07,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265909789] [2023-11-29 02:58:07,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:58:07,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:58:07,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:58:07,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:58:07,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 02:58:07,332 INFO L87 Difference]: Start difference. First operand 703 states and 751 transitions. Second operand has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:58:15,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:58:15,246 INFO L93 Difference]: Finished difference Result 712 states and 761 transitions. [2023-11-29 02:58:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:58:15,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2023-11-29 02:58:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:58:15,251 INFO L225 Difference]: With dead ends: 712 [2023-11-29 02:58:15,251 INFO L226 Difference]: Without dead ends: 712 [2023-11-29 02:58:15,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 02:58:15,252 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 293 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 2876 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 2883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:58:15,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1676 Invalid, 2883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2876 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2023-11-29 02:58:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2023-11-29 02:58:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 702. [2023-11-29 02:58:15,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 416 states have (on average 1.7860576923076923) internal successors, (743), 696 states have internal predecessors, (743), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 02:58:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 750 transitions. [2023-11-29 02:58:15,267 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 750 transitions. Word has length 104 [2023-11-29 02:58:15,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:58:15,268 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 750 transitions. [2023-11-29 02:58:15,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:58:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 750 transitions. [2023-11-29 02:58:15,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 02:58:15,269 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:58:15,269 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:58:15,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:58:15,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-29 02:58:15,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:58:15,670 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 02:58:15,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:58:15,671 INFO L85 PathProgramCache]: Analyzing trace with hash -381267363, now seen corresponding path program 1 times [2023-11-29 02:58:15,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:58:15,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309383175] [2023-11-29 02:58:15,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:58:15,671 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 02:58:15,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:58:15,672 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:58:15,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 02:58:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:58:16,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 02:58:16,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:58:16,482 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 02:58:16,611 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 02:58:16,627 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:58:16,627 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 02:58:16,661 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 02:58:16,668 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 02:58:16,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 22 treesize of output 10 [2023-11-29 02:58:16,809 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 02:58:17,570 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:58:17,571 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 02:58:17,582 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 02:58:17,686 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:58:17,686 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 02:58:17,695 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 02:58:17,711 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 02:58:17,715 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 02:58:17,745 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 02:58:17,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:58:17,888 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3620 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3620) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3619 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3620) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3619) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:58:17,922 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3619 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3620) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_3619) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3620 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_3620) |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 02:58:19,157 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3619 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3711))) (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$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3712) .cse0 v_ArrVal_3620) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_3619) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3620 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3712) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3711) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3620) |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 02:58:19,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:58:19,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309383175] [2023-11-29 02:58:19,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309383175] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:58:19,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2133046320] [2023-11-29 02:58:19,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:58:19,166 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:58:19,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:58:19,167 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:58:19,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 03:00:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:00:19,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 03:00:19,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:00:19,339 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 03:00:19,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:00:19,661 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:00:19,661 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 03:00:19,736 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 03:00:19,745 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 03:00:19,923 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 03:00:19,928 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 03:00:20,689 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:00:20,689 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 03:00:20,698 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 03:00:20,875 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:00:20,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:00:20,884 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 03:00:20,900 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 03:00:20,908 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 03:00:20,913 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 03:00:20,913 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:00:20,973 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:00:21,010 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_4164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:00:22,351 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4257) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4165 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4256))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4257) .cse2 v_ArrVal_4164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:00:22,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2133046320] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:00:22,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:00:22,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 03:00:22,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029333164] [2023-11-29 03:00:22,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:00:22,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 03:00:22,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:00:22,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 03:00:22,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 03:00:22,362 INFO L87 Difference]: Start difference. First operand 702 states and 750 transitions. Second operand has 15 states, 12 states have (on average 9.833333333333334) internal successors, (118), 15 states have internal predecessors, (118), 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 03:00:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:00:31,160 INFO L93 Difference]: Finished difference Result 711 states and 760 transitions. [2023-11-29 03:00:31,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:00:31,162 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.833333333333334) internal successors, (118), 15 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2023-11-29 03:00:31,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:00:31,166 INFO L225 Difference]: With dead ends: 711 [2023-11-29 03:00:31,166 INFO L226 Difference]: Without dead ends: 711 [2023-11-29 03:00:31,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 03:00:31,167 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 348 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 3545 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 3556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:00:31,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1836 Invalid, 3556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3545 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2023-11-29 03:00:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2023-11-29 03:00:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 701. [2023-11-29 03:00:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 416 states have (on average 1.7836538461538463) internal successors, (742), 695 states have internal predecessors, (742), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:00:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 749 transitions. [2023-11-29 03:00:31,182 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 749 transitions. Word has length 106 [2023-11-29 03:00:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:00:31,183 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 749 transitions. [2023-11-29 03:00:31,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.833333333333334) internal successors, (118), 15 states have internal predecessors, (118), 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 03:00:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 749 transitions. [2023-11-29 03:00:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 03:00:31,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:00:31,184 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:00:31,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 03:00:31,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:00:31,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:00:31,585 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 03:00:31,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:00:31,585 INFO L85 PathProgramCache]: Analyzing trace with hash -381267364, now seen corresponding path program 1 times [2023-11-29 03:00:31,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:00:31,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418270888] [2023-11-29 03:00:31,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:31,586 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 03:00:31,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:00:31,587 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:00:31,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:00:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:00:32,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 03:00:32,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:00:32,374 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 03:00:32,508 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:00:32,509 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 03:00:32,554 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 03:00:32,661 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 03:00:33,717 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:00:33,718 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 03:00:33,836 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:00:33,836 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 03:00:33,852 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 03:00:33,894 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 03:00:33,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:00:33,958 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4663) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 03:00:33,970 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4663 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4663) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:00:34,371 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4709 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4709))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4663)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:00:34,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:00:34,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418270888] [2023-11-29 03:00:34,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418270888] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:00:34,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1333027135] [2023-11-29 03:00:34,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:34,374 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:00:34,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:00:34,375 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:00:34,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 03:00:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:00:37,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 03:00:37,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:00:37,739 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:00:37,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 03:00:38,265 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:00:38,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-11-29 03:00:38,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:00:38,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 03:00:40,100 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:00:40,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 03:00:40,338 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:00:40,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 03:00:40,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 03:00:40,445 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 03:00:40,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:00:40,464 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5115) |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 03:00:40,478 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 03:00:40,892 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5115 (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$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5161))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5115)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:00:40,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1333027135] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:00:40,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:00:40,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2023-11-29 03:00:40,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449675126] [2023-11-29 03:00:40,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:00:40,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 03:00:40,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:00:40,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 03:00:40,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=342, Unknown=6, NotChecked=258, Total=702 [2023-11-29 03:00:40,897 INFO L87 Difference]: Start difference. First operand 701 states and 749 transitions. Second operand has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:00:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:00:50,922 INFO L93 Difference]: Finished difference Result 1300 states and 1394 transitions. [2023-11-29 03:00:50,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 03:00:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2023-11-29 03:00:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:00:50,929 INFO L225 Difference]: With dead ends: 1300 [2023-11-29 03:00:50,929 INFO L226 Difference]: Without dead ends: 1300 [2023-11-29 03:00:50,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=125, Invalid=445, Unknown=6, NotChecked=294, Total=870 [2023-11-29 03:00:50,930 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 807 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 3671 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 3685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:00:50,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 2771 Invalid, 3685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3671 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2023-11-29 03:00:50,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2023-11-29 03:00:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 700. [2023-11-29 03:00:50,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 416 states have (on average 1.78125) internal successors, (741), 694 states have internal predecessors, (741), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:00:50,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 748 transitions. [2023-11-29 03:00:50,943 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 748 transitions. Word has length 106 [2023-11-29 03:00:50,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:00:50,943 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 748 transitions. [2023-11-29 03:00:50,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:00:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 748 transitions. [2023-11-29 03:00:50,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 03:00:50,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:00:50,944 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:00:50,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 03:00:51,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:00:51,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:00:51,345 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 03:00:51,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:00:51,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1324767888, now seen corresponding path program 1 times [2023-11-29 03:00:51,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:00:51,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915057643] [2023-11-29 03:00:51,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:51,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:00:51,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:00:51,347 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:00:51,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:00:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:00:52,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 03:00:52,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:00:52,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:00:52,432 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:00:52,432 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 03:00:52,464 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 03:00:52,545 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 03:00:53,430 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:00:53,430 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 03:00:53,559 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:00:53,560 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 03:00:53,666 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:00:53,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:00:53,687 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 03:00:53,741 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 03:00:53,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:00:57,884 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5583 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:00:57,899 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5583 (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$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5582))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5583)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:00:57,914 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5583 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5582))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5583)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:00:58,391 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5583 (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$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5629))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5582)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5583)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:00:58,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:00:58,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915057643] [2023-11-29 03:00:58,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915057643] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:00:58,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [350751952] [2023-11-29 03:00:58,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:58,396 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:00:58,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:00:58,397 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:00:58,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 03:01:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:01:20,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 03:01:20,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:01:20,993 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:01:20,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 03:01:21,556 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:01:21,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-11-29 03:01:21,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:01:21,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 03:01:23,515 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:01:23,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 03:01:23,757 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:01:23,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 03:01:23,905 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:01:23,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 03:01:23,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 03:01:24,026 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 03:01:24,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:01:28,122 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5583 (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$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6050))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5583)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:01:28,139 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5583 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6050))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5583)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:01:28,678 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5583 (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$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6097))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6050)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5583)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:01:28,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [350751952] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:01:28,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:01:28,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2023-11-29 03:01:28,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141790445] [2023-11-29 03:01:28,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:01:28,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 03:01:28,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:01:28,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 03:01:28,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=455, Unknown=9, NotChecked=350, Total=930 [2023-11-29 03:01:28,687 INFO L87 Difference]: Start difference. First operand 700 states and 748 transitions. Second operand has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:01:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:01:38,234 INFO L93 Difference]: Finished difference Result 1298 states and 1392 transitions. [2023-11-29 03:01:38,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 03:01:38,235 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 03:01:38,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:01:38,240 INFO L225 Difference]: With dead ends: 1298 [2023-11-29 03:01:38,240 INFO L226 Difference]: Without dead ends: 1298 [2023-11-29 03:01:38,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=146, Invalid=575, Unknown=9, NotChecked=392, Total=1122 [2023-11-29 03:01:38,241 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 1357 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 3339 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 3360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:01:38,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 2505 Invalid, 3360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3339 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2023-11-29 03:01:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2023-11-29 03:01:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 699. [2023-11-29 03:01:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 416 states have (on average 1.7788461538461537) internal successors, (740), 693 states have internal predecessors, (740), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:01:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 747 transitions. [2023-11-29 03:01:38,252 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 747 transitions. Word has length 108 [2023-11-29 03:01:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:01:38,253 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 747 transitions. [2023-11-29 03:01:38,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:01:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 747 transitions. [2023-11-29 03:01:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 03:01:38,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:01:38,254 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:01:38,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 03:01:38,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:01:38,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:01:38,654 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 03:01:38,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:01:38,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1324767887, now seen corresponding path program 1 times [2023-11-29 03:01:38,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:01:38,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972778378] [2023-11-29 03:01:38,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:01:38,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:01:38,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:01:38,657 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:01:38,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:01:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:01:39,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 03:01:39,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:01:39,632 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 03:01:39,762 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 03:01:39,778 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:01:39,779 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 03:01:39,810 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 03:01:39,819 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 03:01:39,931 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 03:01:39,936 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 03:01:40,702 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:01:40,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:01:40,712 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 03:01:40,842 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:01:40,843 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 03:01:40,854 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 03:01:40,958 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:01:40,958 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 03:01:40,973 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 03:01:40,986 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 03:01:40,994 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 03:01:41,029 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 03:01:41,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:01:41,197 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6567) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6567) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6566) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:01:41,233 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_6567) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_6567) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_6566) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:01:41,452 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6565) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6567) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6564))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6565) .cse2 v_ArrVal_6567) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6566) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:01:41,627 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_6565) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_6564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6567) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_6564))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_6565) .cse3 v_ArrVal_6567) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6566) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:01:43,493 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6658))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6659) .cse1 v_ArrVal_6565) (select (select (store .cse2 .cse1 v_ArrVal_6564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6567))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6658))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6564))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6659) .cse4 v_ArrVal_6565) .cse5 v_ArrVal_6567) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6566) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 03:01:43,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:01:43,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972778378] [2023-11-29 03:01:43,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972778378] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:01:43,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [194957807] [2023-11-29 03:01:43,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:01:43,513 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:01:43,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:01:43,514 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:01:43,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 03:02:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:29,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 03:02:29,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:02:29,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:02:29,630 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:02:29,630 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 03:02:29,646 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 03:02:29,742 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 03:02:29,754 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 03:02:30,045 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 03:02:30,052 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 03:02:31,077 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:31,077 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 03:02:31,085 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 03:02:31,349 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:31,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:02:31,361 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 03:02:31,547 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:31,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:02:31,555 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 03:02:31,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:02:31,591 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 03:02:31,597 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 03:02:31,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:02:31,669 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7129) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7129) |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 03:02:31,712 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_7129) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_7129) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 03:02:31,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_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7127))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7126) .cse0 v_ArrVal_7129) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7126) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7129) |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 03:02:31,974 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7126) (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7129) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_7127))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_7126) .cse3 v_ArrVal_7129) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:02:33,630 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7220))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7221) .cse1 v_ArrVal_7126) (select (select (store .cse2 .cse1 v_ArrVal_7127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7129))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7127 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7128 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7129 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7220))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7127))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7221) .cse4 v_ArrVal_7126) .cse5 v_ArrVal_7129) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7128) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 03:02:33,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [194957807] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:02:33,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:02:33,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 03:02:33,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309258872] [2023-11-29 03:02:33,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:02:33,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 03:02:33,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:02:33,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 03:02:33,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 03:02:33,648 INFO L87 Difference]: Start difference. First operand 699 states and 747 transitions. Second operand has 17 states, 14 states have (on average 8.714285714285714) internal successors, (122), 17 states have internal predecessors, (122), 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 03:02:43,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:02:43,744 INFO L93 Difference]: Finished difference Result 708 states and 757 transitions. [2023-11-29 03:02:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:02:43,746 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.714285714285714) internal successors, (122), 17 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 03:02:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:02:43,749 INFO L225 Difference]: With dead ends: 708 [2023-11-29 03:02:43,749 INFO L226 Difference]: Without dead ends: 708 [2023-11-29 03:02:43,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 03:02:43,750 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 336 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:02:43,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1492 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2693 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2023-11-29 03:02:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2023-11-29 03:02:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 698. [2023-11-29 03:02:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 416 states have (on average 1.7764423076923077) internal successors, (739), 692 states have internal predecessors, (739), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:02:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 746 transitions. [2023-11-29 03:02:43,760 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 746 transitions. Word has length 108 [2023-11-29 03:02:43,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:02:43,760 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 746 transitions. [2023-11-29 03:02:43,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.714285714285714) internal successors, (122), 17 states have internal predecessors, (122), 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 03:02:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 746 transitions. [2023-11-29 03:02:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 03:02:43,761 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:02:43,761 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:02:43,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:02:43,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 03:02:44,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:02:44,162 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 03:02:44,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:02:44,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1790677538, now seen corresponding path program 1 times [2023-11-29 03:02:44,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:02:44,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262595524] [2023-11-29 03:02:44,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:02:44,163 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 03:02:44,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:02:44,164 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:02:44,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:02:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:45,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 03:02:45,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:02:45,303 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 03:02:45,553 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:02:45,554 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 03:02:45,607 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 03:02:45,764 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 03:02:47,169 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:02:47,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:02:47,363 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:02:47,363 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 03:02:47,501 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:02:47,501 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 03:02:47,657 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:02:47,658 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 03:02:47,679 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 03:02:47,753 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 03:02:47,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:02:51,963 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7659 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:02:51,985 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (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$#2.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7658))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7659)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:02:52,007 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7658))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7659)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:02:52,032 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (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$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7657))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7658)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7659)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:02:52,058 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7657))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7658)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7659)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:02:52,641 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7705))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7657)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7658)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7659)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:02:52,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:02:52,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262595524] [2023-11-29 03:02:52,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262595524] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:02:52,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [357048962] [2023-11-29 03:02:52,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:02:52,648 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:02:52,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:02:52,649 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:02:52,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 03:03:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:44,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 03:03:44,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:03:44,482 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:03:44,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 03:03:45,243 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:03:45,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-11-29 03:03:45,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:03:45,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 03:03:47,981 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:03:47,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 03:03:48,370 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:03:48,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 03:03:48,634 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:03:48,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 03:03:48,858 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:03:48,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 03:03:48,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 03:03:49,015 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 03:03:49,015 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:03:49,041 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8143 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8143) |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 03:03:49,059 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8143 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:03:49,080 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8142 (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$#2.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8142))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8143)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:03:49,102 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8142 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8142))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8143)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:03:49,125 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8141 (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$#2.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8141))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8142)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8143)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:03:49,152 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8141 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8141))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8142)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8143)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:03:49,727 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8189 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8189))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8141)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8142)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8143)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:03:49,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [357048962] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:03:49,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:03:49,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2023-11-29 03:03:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229741719] [2023-11-29 03:03:49,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:03:49,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 03:03:49,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:03:49,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 03:03:49,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=546, Unknown=14, NotChecked=780, Total=1482 [2023-11-29 03:03:49,736 INFO L87 Difference]: Start difference. First operand 698 states and 746 transitions. Second operand has 23 states, 20 states have (on average 6.6) internal successors, (132), 23 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:04:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:04:04,986 INFO L93 Difference]: Finished difference Result 1294 states and 1388 transitions. [2023-11-29 03:04:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 03:04:04,987 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.6) internal successors, (132), 23 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 03:04:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:04:04,994 INFO L225 Difference]: With dead ends: 1294 [2023-11-29 03:04:04,994 INFO L226 Difference]: Without dead ends: 1294 [2023-11-29 03:04:04,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=173, Invalid=677, Unknown=14, NotChecked=858, Total=1722 [2023-11-29 03:04:04,995 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 1066 mSDsluCounter, 2796 mSDsCounter, 0 mSdLazyCounter, 4183 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 3075 SdHoareTripleChecker+Invalid, 4201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:04:04,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 3075 Invalid, 4201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4183 Invalid, 0 Unknown, 0 Unchecked, 14.9s Time] [2023-11-29 03:04:04,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2023-11-29 03:04:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 697. [2023-11-29 03:04:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 416 states have (on average 1.7740384615384615) internal successors, (738), 691 states have internal predecessors, (738), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:04:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 745 transitions. [2023-11-29 03:04:05,006 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 745 transitions. Word has length 110 [2023-11-29 03:04:05,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:04:05,006 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 745 transitions. [2023-11-29 03:04:05,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.6) internal successors, (132), 23 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:04:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 745 transitions. [2023-11-29 03:04:05,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 03:04:05,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:04:05,007 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:04:05,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:04:05,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 03:04:05,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:04:05,408 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 03:04:05,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:04:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1790677537, now seen corresponding path program 1 times [2023-11-29 03:04:05,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:04:05,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634700145] [2023-11-29 03:04:05,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:04:05,409 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 03:04:05,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:04:05,410 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:04:05,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/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 03:04:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:04:06,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 03:04:06,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:04:06,740 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 03:04:06,961 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 03:04:06,986 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:04:06,986 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 03:04:07,032 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 03:04:07,051 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 03:04:07,209 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 03:04:07,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 03:04:08,334 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:04:08,335 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 03:04:08,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:04:08,536 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:04:08,536 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 03:04:08,551 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 03:04:08,702 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:04:08,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:04:08,722 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 03:04:08,865 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:04:08,865 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 03:04:08,883 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 03:04:08,899 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 03:04:08,906 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 03:04:08,962 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 03:04:08,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:04:09,190 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8675 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:04:09,233 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_8676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8675 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_8676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_8675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:04:09,290 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8674))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8673) .cse0 v_ArrVal_8676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8673) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8674) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8676) |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 03:04:09,344 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_8674))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_8673) .cse1 v_ArrVal_8676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_8673) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_8674) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2023-11-29 03:04:22,248 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_8672))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_8671) .cse2 v_ArrVal_8673) (select (select (store .cse3 .cse2 v_ArrVal_8674) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8676))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse1 v_ArrVal_8672))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_8674))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 v_ArrVal_8671) .cse5 v_ArrVal_8673) .cse6 v_ArrVal_8676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_8675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 03:04:29,878 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8767 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8768))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_8672))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8767) .cse1 v_ArrVal_8671) .cse2 v_ArrVal_8673) (select (select (store .cse3 .cse2 v_ArrVal_8674) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8676))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8768 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8767 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8768))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_8672))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_8674))) (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$#2.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8767) .cse6 v_ArrVal_8671) .cse7 v_ArrVal_8673) .cse8 v_ArrVal_8676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_8675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 03:04:29,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:04:29,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634700145] [2023-11-29 03:04:29,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634700145] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:04:29,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1939145528] [2023-11-29 03:04:29,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:04:29,920 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:04:29,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:04:29,921 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:04:29,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92bd2e95-0023-47dd-8d5b-b8685358e4b8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process