./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/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_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/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_547a6603-bcc3-4f63-b296-270c2e3b037d/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 be1dcf4f68625d62d28b81607385317c3749a3b9c4401099e862ce9a8a6e6751 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:53:35,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:53:35,203 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:53:35,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:53:35,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:53:35,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:53:35,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:53:35,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:53:35,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:53:35,247 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:53:35,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:53:35,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:53:35,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:53:35,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:53:35,250 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:53:35,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:53:35,251 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:53:35,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:53:35,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:53:35,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:53:35,253 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:53:35,254 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:53:35,254 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:53:35,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:53:35,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:53:35,255 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:53:35,256 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:53:35,256 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:53:35,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:53:35,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:53:35,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:53:35,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:53:35,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:53:35,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:53:35,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:53:35,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:53:35,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:53:35,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:53:35,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:53:35,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:53:35,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:53:35,260 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_547a6603-bcc3-4f63-b296-270c2e3b037d/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_547a6603-bcc3-4f63-b296-270c2e3b037d/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 -> be1dcf4f68625d62d28b81607385317c3749a3b9c4401099e862ce9a8a6e6751 [2023-11-29 02:53:35,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:53:35,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:53:35,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:53:35,510 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:53:35,511 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:53:35,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-1.i [2023-11-29 02:53:38,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:53:38,540 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:53:38,540 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-1.i [2023-11-29 02:53:38,558 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/data/f657a4a7f/b0b25be045ff4d48a20031f8882dc111/FLAGce3afaf1b [2023-11-29 02:53:38,573 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/data/f657a4a7f/b0b25be045ff4d48a20031f8882dc111 [2023-11-29 02:53:38,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:53:38,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:53:38,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:53:38,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:53:38,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:53:38,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:53:38" (1/1) ... [2023-11-29 02:53:38,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713b1e70 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,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:53:38" (1/1) ... [2023-11-29 02:53:38,655 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:53:39,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:53:39,112 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:39,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3c7c1520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:39, skipping insertion in model container [2023-11-29 02:53:39,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:53:39,113 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 02:53:39,115 INFO L158 Benchmark]: Toolchain (without parser) took 537.37ms. Allocated memory is still 167.8MB. Free memory was 125.2MB in the beginning and 104.7MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 02:53:39,115 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:53:39,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.17ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 104.7MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 02:53:39,117 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.17ms. Allocated memory is still 167.8MB. Free memory was 124.7MB in the beginning and 104.7MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/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_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/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_547a6603-bcc3-4f63-b296-270c2e3b037d/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 be1dcf4f68625d62d28b81607385317c3749a3b9c4401099e862ce9a8a6e6751 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:53:40,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:53:40,952 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 02:53:40,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:53:40,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:53:40,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:53:40,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:53:40,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:53:40,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:53:40,987 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:53:40,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:53:40,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:53:40,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:53:40,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:53:40,990 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:53:40,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:53:40,991 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:53:40,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:53:40,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:53:40,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:53:40,993 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:53:40,994 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:53:40,994 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:53:40,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:53:40,995 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:53:40,996 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:53:40,996 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:53:40,996 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:53:40,997 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:53:40,997 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:53:40,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:53:40,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:53:40,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:53:40,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:53:40,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:53:40,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:53:41,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:53:41,000 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:53:41,000 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:53:41,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:53:41,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:53:41,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:53:41,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:53:41,001 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:53:41,001 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_547a6603-bcc3-4f63-b296-270c2e3b037d/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_547a6603-bcc3-4f63-b296-270c2e3b037d/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 -> be1dcf4f68625d62d28b81607385317c3749a3b9c4401099e862ce9a8a6e6751 [2023-11-29 02:53:41,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:53:41,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:53:41,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:53:41,323 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:53:41,323 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:53:41,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-1.i [2023-11-29 02:53:44,098 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:53:44,386 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:53:44,387 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-1.i [2023-11-29 02:53:44,404 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/data/3c6724523/56bc05a436bf4995abe97cfd97f5b4ca/FLAGbb597df3f [2023-11-29 02:53:44,420 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/data/3c6724523/56bc05a436bf4995abe97cfd97f5b4ca [2023-11-29 02:53:44,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:53:44,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:53:44,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:53:44,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:53:44,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:53:44,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:53:44" (1/1) ... [2023-11-29 02:53:44,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b80a065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:44, skipping insertion in model container [2023-11-29 02:53:44,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:53:44" (1/1) ... [2023-11-29 02:53:44,503 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:53:45,048 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:53:45,063 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 02:53:45,076 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:53:45,160 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:53:45,164 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:53:45,238 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:53:45,300 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:53:45,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:45 WrapperNode [2023-11-29 02:53:45,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:53:45,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:53:45,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:53:45,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:53:45,307 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:45" (1/1) ... [2023-11-29 02:53:45,339 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:45" (1/1) ... [2023-11-29 02:53:45,393 INFO L138 Inliner]: procedures = 180, calls = 350, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1173 [2023-11-29 02:53:45,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:53:45,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:53:45,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:53:45,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:53:45,403 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:45" (1/1) ... [2023-11-29 02:53:45,404 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:45" (1/1) ... [2023-11-29 02:53:45,414 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:45" (1/1) ... [2023-11-29 02:53:45,486 INFO L175 MemorySlicer]: Split 319 memory accesses to 4 slices as follows [2, 307, 5, 5]. 96 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 84 writes are split as follows [0, 82, 1, 1]. [2023-11-29 02:53:45,486 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:45" (1/1) ... [2023-11-29 02:53:45,486 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:45" (1/1) ... [2023-11-29 02:53:45,523 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:45" (1/1) ... [2023-11-29 02:53:45,532 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:45" (1/1) ... [2023-11-29 02:53:45,538 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:45" (1/1) ... [2023-11-29 02:53:45,546 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:45" (1/1) ... [2023-11-29 02:53:45,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:53:45,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:53:45,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:53:45,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:53:45,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:45" (1/1) ... [2023-11-29 02:53:45,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:53:45,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:53:45,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/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:45,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/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:45,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 02:53:45,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 02:53:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 02:53:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 02:53:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 02:53:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 02:53:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 02:53:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 02:53:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 02:53:45,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 02:53:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 02:53:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 02:53:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 02:53:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 02:53:45,623 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 02:53:45,623 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 02:53:45,623 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 02:53:45,623 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 02:53:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:53:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:53:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:53:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:53:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:53:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 02:53:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 02:53:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:53:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:53:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 02:53:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 02:53:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:53:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 02:53:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 02:53:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 02:53:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 02:53:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:53:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 02:53:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 02:53:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 02:53:45,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:53:45,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:53:45,869 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:53:45,870 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:53:45,874 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:53:45,920 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:53:45,941 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:53:45,962 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:53:51,065 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:53:51,254 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:53:51,254 INFO L309 CfgBuilder]: Removed 60 assume(true) statements. [2023-11-29 02:53:51,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:53:51 BoogieIcfgContainer [2023-11-29 02:53:51,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:53:51,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:53:51,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:53:51,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:53:51,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:53:44" (1/3) ... [2023-11-29 02:53:51,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3de735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:53:51, skipping insertion in model container [2023-11-29 02:53:51,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:53:45" (2/3) ... [2023-11-29 02:53:51,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3de735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:53:51, skipping insertion in model container [2023-11-29 02:53:51,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:53:51" (3/3) ... [2023-11-29 02:53:51,263 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test4-1.i [2023-11-29 02:53:51,279 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:53:51,279 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 648 error locations. [2023-11-29 02:53:51,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:53:51,341 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;@546bcd37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:53:51,341 INFO L358 AbstractCegarLoop]: Starting to check reachability of 648 error locations. [2023-11-29 02:53:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 1157 states, 496 states have (on average 2.5524193548387095) internal successors, (1266), 1148 states have internal predecessors, (1266), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:53:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 02:53:51,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:51,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 02:53:51,355 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:53:51,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:51,359 INFO L85 PathProgramCache]: Analyzing trace with hash 62011059, now seen corresponding path program 1 times [2023-11-29 02:53:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:51,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435939127] [2023-11-29 02:53:51,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:51,370 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,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:51,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:51,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 02:53:51,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:51,554 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,554 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:51,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:51,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435939127] [2023-11-29 02:53:51,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435939127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:51,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:51,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:53:51,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830676876] [2023-11-29 02:53:51,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:51,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:53:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:51,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:53:51,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:53:51,588 INFO L87 Difference]: Start difference. First operand has 1157 states, 496 states have (on average 2.5524193548387095) internal successors, (1266), 1148 states have internal predecessors, (1266), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) 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:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:52,394 INFO L93 Difference]: Finished difference Result 1138 states and 1210 transitions. [2023-11-29 02:53:52,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:53:52,398 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:52,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:52,419 INFO L225 Difference]: With dead ends: 1138 [2023-11-29 02:53:52,419 INFO L226 Difference]: Without dead ends: 1137 [2023-11-29 02:53:52,420 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:52,423 INFO L413 NwaCegarLoop]: 1085 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:52,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1085 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 02:53:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2023-11-29 02:53:52,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1137. [2023-11-29 02:53:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 487 states have (on average 2.4168377823408624) internal successors, (1177), 1128 states have internal predecessors, (1177), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:53:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1209 transitions. [2023-11-29 02:53:52,511 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1209 transitions. Word has length 4 [2023-11-29 02:53:52,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:52,512 INFO L495 AbstractCegarLoop]: Abstraction has 1137 states and 1209 transitions. [2023-11-29 02:53:52,512 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:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1209 transitions. [2023-11-29 02:53:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 02:53:52,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:52,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 02:53:52,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:52,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:52,713 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:53:52,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:52,714 INFO L85 PathProgramCache]: Analyzing trace with hash 62011121, now seen corresponding path program 1 times [2023-11-29 02:53:52,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:52,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750605469] [2023-11-29 02:53:52,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:52,715 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:52,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:52,716 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:52,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:52,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:53:52,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:52,884 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:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:52,899 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:52,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:52,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750605469] [2023-11-29 02:53:52,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750605469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:52,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:52,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:53:52,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964657328] [2023-11-29 02:53:52,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:52,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:53:52,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:52,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:53:52,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:53:52,904 INFO L87 Difference]: Start difference. First operand 1137 states and 1209 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:55,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:55,295 INFO L93 Difference]: Finished difference Result 1167 states and 1252 transitions. [2023-11-29 02:53:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:53:55,296 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:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:55,302 INFO L225 Difference]: With dead ends: 1167 [2023-11-29 02:53:55,302 INFO L226 Difference]: Without dead ends: 1167 [2023-11-29 02:53:55,302 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:55,304 INFO L413 NwaCegarLoop]: 481 mSDtfsCounter, 1042 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:55,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 576 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 02:53:55,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2023-11-29 02:53:55,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1110. [2023-11-29 02:53:55,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 553 states have (on average 2.18625678119349) internal successors, (1209), 1101 states have internal predecessors, (1209), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:53:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1241 transitions. [2023-11-29 02:53:55,331 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1241 transitions. Word has length 4 [2023-11-29 02:53:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:55,331 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1241 transitions. [2023-11-29 02:53:55,331 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:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1241 transitions. [2023-11-29 02:53:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 02:53:55,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:55,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 02:53:55,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:55,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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,532 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:53:55,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:55,533 INFO L85 PathProgramCache]: Analyzing trace with hash 62011122, now seen corresponding path program 1 times [2023-11-29 02:53:55,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:55,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952551831] [2023-11-29 02:53:55,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:55,534 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,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:55,535 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:55,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:53:55,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:55,634 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:55,653 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,654 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:55,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:55,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952551831] [2023-11-29 02:53:55,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952551831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:55,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:55,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:53:55,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554444226] [2023-11-29 02:53:55,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:55,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:53:55,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:55,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:53:55,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:53:55,656 INFO L87 Difference]: Start difference. First operand 1110 states and 1241 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:59,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:59,254 INFO L93 Difference]: Finished difference Result 1382 states and 1533 transitions. [2023-11-29 02:53:59,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:53:59,255 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:59,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:59,263 INFO L225 Difference]: With dead ends: 1382 [2023-11-29 02:53:59,263 INFO L226 Difference]: Without dead ends: 1382 [2023-11-29 02:53:59,263 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:59,264 INFO L413 NwaCegarLoop]: 809 mSDtfsCounter, 456 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:59,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1198 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-29 02:53:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2023-11-29 02:53:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1233. [2023-11-29 02:53:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 686 states have (on average 2.1603498542274053) internal successors, (1482), 1224 states have internal predecessors, (1482), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:53:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1514 transitions. [2023-11-29 02:53:59,304 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1514 transitions. Word has length 4 [2023-11-29 02:53:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:59,304 INFO L495 AbstractCegarLoop]: Abstraction has 1233 states and 1514 transitions. [2023-11-29 02:53:59,304 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:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1514 transitions. [2023-11-29 02:53:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 02:53:59,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:59,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:53:59,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:59,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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,507 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:53:59,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:59,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1924036044, now seen corresponding path program 1 times [2023-11-29 02:53:59,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:59,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082557900] [2023-11-29 02:53:59,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:59,508 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,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:59,509 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:59,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:53:59,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:59,621 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,621 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:59,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:59,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082557900] [2023-11-29 02:53:59,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082557900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:59,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:59,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:53:59,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933584899] [2023-11-29 02:53:59,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:59,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:53:59,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:59,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:53:59,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:53:59,623 INFO L87 Difference]: Start difference. First operand 1233 states and 1514 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:54:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:01,371 INFO L93 Difference]: Finished difference Result 2422 states and 2964 transitions. [2023-11-29 02:54:01,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:54:01,373 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:54:01,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:01,384 INFO L225 Difference]: With dead ends: 2422 [2023-11-29 02:54:01,384 INFO L226 Difference]: Without dead ends: 2422 [2023-11-29 02:54:01,384 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:54:01,385 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 1029 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:01,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1955 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 02:54:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2023-11-29 02:54:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 1234. [2023-11-29 02:54:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 687 states have (on average 2.158660844250364) internal successors, (1483), 1225 states have internal predecessors, (1483), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:54:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1515 transitions. [2023-11-29 02:54:01,419 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1515 transitions. Word has length 5 [2023-11-29 02:54:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:01,420 INFO L495 AbstractCegarLoop]: Abstraction has 1234 states and 1515 transitions. [2023-11-29 02:54:01,420 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:54:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1515 transitions. [2023-11-29 02:54:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 02:54:01,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:01,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:01,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:54:01,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:01,623 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:54:01,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:01,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2120129477, now seen corresponding path program 1 times [2023-11-29 02:54:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501040422] [2023-11-29 02:54:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:01,624 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:01,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:01,625 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:01,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:54:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:01,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:54:01,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:01,780 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:01,780 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:01,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:01,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501040422] [2023-11-29 02:54:01,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501040422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:01,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:54:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583839698] [2023-11-29 02:54:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:01,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:54:01,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:01,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:54:01,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:54:01,782 INFO L87 Difference]: Start difference. First operand 1234 states and 1515 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:02,733 INFO L93 Difference]: Finished difference Result 1195 states and 1475 transitions. [2023-11-29 02:54:02,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:54:02,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2023-11-29 02:54:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:02,739 INFO L225 Difference]: With dead ends: 1195 [2023-11-29 02:54:02,739 INFO L226 Difference]: Without dead ends: 1195 [2023-11-29 02:54:02,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:02,740 INFO L413 NwaCegarLoop]: 933 mSDtfsCounter, 70 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:02,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1817 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:54:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2023-11-29 02:54:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1195. [2023-11-29 02:54:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 672 states have (on average 2.1473214285714284) internal successors, (1443), 1186 states have internal predecessors, (1443), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:54:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1475 transitions. [2023-11-29 02:54:02,763 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1475 transitions. Word has length 10 [2023-11-29 02:54:02,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:02,764 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1475 transitions. [2023-11-29 02:54:02,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1475 transitions. [2023-11-29 02:54:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 02:54:02,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:02,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:02,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-29 02:54:02,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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,965 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:54:02,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:02,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1629932395, now seen corresponding path program 1 times [2023-11-29 02:54:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:02,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163760080] [2023-11-29 02:54:02,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:02,967 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,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:02,968 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:54:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:03,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:54:03,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:03,127 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:03,127 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:03,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:03,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163760080] [2023-11-29 02:54:03,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163760080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:03,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:03,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:54:03,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729391681] [2023-11-29 02:54:03,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:03,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:54:03,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:03,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:54:03,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:54:03,130 INFO L87 Difference]: Start difference. First operand 1195 states and 1475 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:04,365 INFO L93 Difference]: Finished difference Result 1181 states and 1454 transitions. [2023-11-29 02:54:04,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:54:04,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 02:54:04,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:04,372 INFO L225 Difference]: With dead ends: 1181 [2023-11-29 02:54:04,372 INFO L226 Difference]: Without dead ends: 1181 [2023-11-29 02:54:04,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:54:04,372 INFO L413 NwaCegarLoop]: 902 mSDtfsCounter, 58 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2682 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:04,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2682 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 02:54:04,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2023-11-29 02:54:04,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1180. [2023-11-29 02:54:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 671 states have (on average 2.1177347242921014) internal successors, (1421), 1171 states have internal predecessors, (1421), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:54:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1453 transitions. [2023-11-29 02:54:04,396 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1453 transitions. Word has length 12 [2023-11-29 02:54:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:04,397 INFO L495 AbstractCegarLoop]: Abstraction has 1180 states and 1453 transitions. [2023-11-29 02:54:04,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1453 transitions. [2023-11-29 02:54:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 02:54:04,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:04,398 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] [2023-11-29 02:54:04,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:54:04,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:04,601 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:54:04,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:04,601 INFO L85 PathProgramCache]: Analyzing trace with hash 380814595, now seen corresponding path program 1 times [2023-11-29 02:54:04,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:04,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669293281] [2023-11-29 02:54:04,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:04,602 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:04,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:04,602 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:04,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:54:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:04,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:54:04,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:04,751 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:04,852 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,852 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:04,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:04,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669293281] [2023-11-29 02:54:04,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669293281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:04,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:04,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:54:04,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684688055] [2023-11-29 02:54:04,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:04,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:54:04,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:04,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:54:04,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:54:04,855 INFO L87 Difference]: Start difference. First operand 1180 states and 1453 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:07,613 INFO L93 Difference]: Finished difference Result 1233 states and 1460 transitions. [2023-11-29 02:54:07,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:54:07,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2023-11-29 02:54:07,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:07,620 INFO L225 Difference]: With dead ends: 1233 [2023-11-29 02:54:07,620 INFO L226 Difference]: Without dead ends: 1233 [2023-11-29 02:54:07,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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:07,621 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 977 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:07,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 913 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 02:54:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2023-11-29 02:54:07,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1176. [2023-11-29 02:54:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 671 states have (on average 2.1117734724292103) internal successors, (1417), 1167 states have internal predecessors, (1417), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:54:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1449 transitions. [2023-11-29 02:54:07,651 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1449 transitions. Word has length 26 [2023-11-29 02:54:07,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:07,652 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1449 transitions. [2023-11-29 02:54:07,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1449 transitions. [2023-11-29 02:54:07,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 02:54:07,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:07,652 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] [2023-11-29 02:54:07,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:54:07,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:07,853 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:54:07,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:07,854 INFO L85 PathProgramCache]: Analyzing trace with hash 380814596, now seen corresponding path program 1 times [2023-11-29 02:54:07,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:07,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531010399] [2023-11-29 02:54:07,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:07,855 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:07,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:07,856 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:54:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:08,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:54:08,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:08,012 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:08,202 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,202 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:08,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:08,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531010399] [2023-11-29 02:54:08,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531010399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:08,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:08,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:54:08,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100722955] [2023-11-29 02:54:08,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:08,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:54:08,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:08,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:54:08,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:54:08,204 INFO L87 Difference]: Start difference. First operand 1176 states and 1449 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:12,196 INFO L93 Difference]: Finished difference Result 1321 states and 1464 transitions. [2023-11-29 02:54:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:54:12,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2023-11-29 02:54:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:12,203 INFO L225 Difference]: With dead ends: 1321 [2023-11-29 02:54:12,203 INFO L226 Difference]: Without dead ends: 1321 [2023-11-29 02:54:12,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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:12,204 INFO L413 NwaCegarLoop]: 773 mSDtfsCounter, 393 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:12,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1577 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-11-29 02:54:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2023-11-29 02:54:12,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1172. [2023-11-29 02:54:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 671 states have (on average 2.105812220566319) internal successors, (1413), 1163 states have internal predecessors, (1413), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:54:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1445 transitions. [2023-11-29 02:54:12,229 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1445 transitions. Word has length 26 [2023-11-29 02:54:12,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:12,230 INFO L495 AbstractCegarLoop]: Abstraction has 1172 states and 1445 transitions. [2023-11-29 02:54:12,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1445 transitions. [2023-11-29 02:54:12,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 02:54:12,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:12,231 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] [2023-11-29 02:54:12,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:12,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:12,432 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:54:12,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:12,432 INFO L85 PathProgramCache]: Analyzing trace with hash 192720509, now seen corresponding path program 1 times [2023-11-29 02:54:12,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:12,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658661191] [2023-11-29 02:54:12,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:12,433 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:12,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:12,434 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:12,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:12,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:54:12,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:12,643 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:12,643 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:12,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:12,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658661191] [2023-11-29 02:54:12,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658661191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:12,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:12,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:54:12,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8887936] [2023-11-29 02:54:12,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:12,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:54:12,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:12,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:54:12,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:54:12,645 INFO L87 Difference]: Start difference. First operand 1172 states and 1445 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:13,868 INFO L93 Difference]: Finished difference Result 1166 states and 1435 transitions. [2023-11-29 02:54:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:54:13,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2023-11-29 02:54:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:13,875 INFO L225 Difference]: With dead ends: 1166 [2023-11-29 02:54:13,875 INFO L226 Difference]: Without dead ends: 1166 [2023-11-29 02:54:13,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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:13,876 INFO L413 NwaCegarLoop]: 896 mSDtfsCounter, 23 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2668 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:13,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2668 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 02:54:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2023-11-29 02:54:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1166. [2023-11-29 02:54:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 665 states have (on average 2.1097744360902255) internal successors, (1403), 1157 states have internal predecessors, (1403), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:54:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1435 transitions. [2023-11-29 02:54:13,898 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1435 transitions. Word has length 42 [2023-11-29 02:54:13,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:13,899 INFO L495 AbstractCegarLoop]: Abstraction has 1166 states and 1435 transitions. [2023-11-29 02:54:13,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1435 transitions. [2023-11-29 02:54:13,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 02:54:13,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:13,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:13,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:14,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:14,101 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:54:14,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:14,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2124802211, now seen corresponding path program 1 times [2023-11-29 02:54:14,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:14,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257041486] [2023-11-29 02:54:14,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:14,102 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:14,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:14,103 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:14,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:14,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:54:14,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:14,578 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,578 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:14,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257041486] [2023-11-29 02:54:14,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257041486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:14,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:14,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:54:14,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40766996] [2023-11-29 02:54:14,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:14,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:54:14,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:14,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:54:14,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:54:14,580 INFO L87 Difference]: Start difference. First operand 1166 states and 1435 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:15,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:15,507 INFO L93 Difference]: Finished difference Result 1209 states and 1478 transitions. [2023-11-29 02:54:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:54:15,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-11-29 02:54:15,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:15,514 INFO L225 Difference]: With dead ends: 1209 [2023-11-29 02:54:15,514 INFO L226 Difference]: Without dead ends: 1209 [2023-11-29 02:54:15,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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:15,515 INFO L413 NwaCegarLoop]: 911 mSDtfsCounter, 59 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:15,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1744 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:54:15,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2023-11-29 02:54:15,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2023-11-29 02:54:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 708 states have (on average 2.042372881355932) internal successors, (1446), 1200 states have internal predecessors, (1446), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:54:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1478 transitions. [2023-11-29 02:54:15,533 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1478 transitions. Word has length 46 [2023-11-29 02:54:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:15,533 INFO L495 AbstractCegarLoop]: Abstraction has 1209 states and 1478 transitions. [2023-11-29 02:54:15,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:54:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1478 transitions. [2023-11-29 02:54:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 02:54:15,535 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:15,535 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] [2023-11-29 02:54:15,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-29 02:54:15,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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,739 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:54:15,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:15,740 INFO L85 PathProgramCache]: Analyzing trace with hash -862114412, now seen corresponding path program 1 times [2023-11-29 02:54:15,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:15,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412036740] [2023-11-29 02:54:15,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:15,741 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,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:15,742 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:16,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 02:54:16,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:16,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:54:16,106 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:16,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:54:16,593 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:16,614 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:54:16,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:54:16,627 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:16,627 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:16,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:16,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412036740] [2023-11-29 02:54:16,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412036740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:16,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:16,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:54:16,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564198105] [2023-11-29 02:54:16,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:16,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:54:16,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:16,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:54:16,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:54:16,629 INFO L87 Difference]: Start difference. First operand 1209 states and 1478 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:19,412 INFO L93 Difference]: Finished difference Result 1181 states and 1404 transitions. [2023-11-29 02:54:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:54:19,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2023-11-29 02:54:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:19,417 INFO L225 Difference]: With dead ends: 1181 [2023-11-29 02:54:19,417 INFO L226 Difference]: Without dead ends: 1181 [2023-11-29 02:54:19,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 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:19,418 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 943 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:19,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 402 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 02:54:19,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2023-11-29 02:54:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 992. [2023-11-29 02:54:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 575 states have (on average 1.8747826086956523) internal successors, (1078), 983 states have internal predecessors, (1078), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:54:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1110 transitions. [2023-11-29 02:54:19,438 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1110 transitions. Word has length 49 [2023-11-29 02:54:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:19,438 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1110 transitions. [2023-11-29 02:54:19,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1110 transitions. [2023-11-29 02:54:19,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 02:54:19,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:19,440 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] [2023-11-29 02:54:19,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:19,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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,644 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:54:19,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:19,645 INFO L85 PathProgramCache]: Analyzing trace with hash 440084550, now seen corresponding path program 1 times [2023-11-29 02:54:19,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:19,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23304644] [2023-11-29 02:54:19,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:19,646 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,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:19,647 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:19,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 02:54:19,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:19,912 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:19,925 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:19,950 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:19,960 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:19,960 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:19,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:19,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23304644] [2023-11-29 02:54:19,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23304644] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:19,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:19,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:54:19,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776095063] [2023-11-29 02:54:19,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:19,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:54:19,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:19,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:54:19,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:54:19,962 INFO L87 Difference]: Start difference. First operand 992 states and 1110 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:23,322 INFO L93 Difference]: Finished difference Result 991 states and 1109 transitions. [2023-11-29 02:54:23,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:54:23,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2023-11-29 02:54:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:23,327 INFO L225 Difference]: With dead ends: 991 [2023-11-29 02:54:23,327 INFO L226 Difference]: Without dead ends: 991 [2023-11-29 02:54:23,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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:23,328 INFO L413 NwaCegarLoop]: 824 mSDtfsCounter, 3 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:23,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2112 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 02:54:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2023-11-29 02:54:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2023-11-29 02:54:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 575 states have (on average 1.8730434782608696) internal successors, (1077), 982 states have internal predecessors, (1077), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:54:23,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1109 transitions. [2023-11-29 02:54:23,341 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1109 transitions. Word has length 53 [2023-11-29 02:54:23,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:23,341 INFO L495 AbstractCegarLoop]: Abstraction has 991 states and 1109 transitions. [2023-11-29 02:54:23,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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:23,341 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1109 transitions. [2023-11-29 02:54:23,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 02:54:23,342 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:23,342 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] [2023-11-29 02:54:23,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 02:54:23,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:23,542 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:54:23,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:23,543 INFO L85 PathProgramCache]: Analyzing trace with hash 440084551, now seen corresponding path program 1 times [2023-11-29 02:54:23,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:23,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503112487] [2023-11-29 02:54:23,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:23,544 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:23,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:23,544 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:23,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:23,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 02:54:23,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:23,770 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:23,790 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:23,798 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:23,841 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:23,861 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:23,861 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:23,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:23,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503112487] [2023-11-29 02:54:23,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503112487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:23,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:23,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:54:23,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281639149] [2023-11-29 02:54:23,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:23,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:54:23,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:23,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:54:23,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:54:23,864 INFO L87 Difference]: Start difference. First operand 991 states and 1109 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:28,014 INFO L93 Difference]: Finished difference Result 990 states and 1108 transitions. [2023-11-29 02:54:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:54:28,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2023-11-29 02:54:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:28,018 INFO L225 Difference]: With dead ends: 990 [2023-11-29 02:54:28,018 INFO L226 Difference]: Without dead ends: 990 [2023-11-29 02:54:28,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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:28,019 INFO L413 NwaCegarLoop]: 824 mSDtfsCounter, 1 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:28,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2135 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 02:54:28,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2023-11-29 02:54:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2023-11-29 02:54:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 574 states have (on average 1.8745644599303135) internal successors, (1076), 981 states have internal predecessors, (1076), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:54:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1108 transitions. [2023-11-29 02:54:28,031 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1108 transitions. Word has length 53 [2023-11-29 02:54:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:28,032 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 1108 transitions. [2023-11-29 02:54:28,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1108 transitions. [2023-11-29 02:54:28,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 02:54:28,033 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:28,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:28,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 02:54:28,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:28,233 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:54:28,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:28,234 INFO L85 PathProgramCache]: Analyzing trace with hash -876921302, now seen corresponding path program 1 times [2023-11-29 02:54:28,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:28,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936077606] [2023-11-29 02:54:28,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:28,234 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:28,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:28,235 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:28,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:54:28,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:28,491 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:28,491 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:54:28,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:28,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936077606] [2023-11-29 02:54:28,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936077606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:54:28,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:54:28,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:54:28,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34547449] [2023-11-29 02:54:28,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:54:28,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:54:28,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:28,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:54:28,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:54:28,493 INFO L87 Difference]: Start difference. First operand 990 states and 1108 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:54:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:29,712 INFO L93 Difference]: Finished difference Result 992 states and 1112 transitions. [2023-11-29 02:54:29,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:54:29,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-11-29 02:54:29,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:29,719 INFO L225 Difference]: With dead ends: 992 [2023-11-29 02:54:29,719 INFO L226 Difference]: Without dead ends: 992 [2023-11-29 02:54:29,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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:29,720 INFO L413 NwaCegarLoop]: 823 mSDtfsCounter, 1 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:29,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2463 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 02:54:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2023-11-29 02:54:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2023-11-29 02:54:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 575 states have (on average 1.8747826086956523) internal successors, (1078), 983 states have internal predecessors, (1078), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:54:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1112 transitions. [2023-11-29 02:54:29,741 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1112 transitions. Word has length 59 [2023-11-29 02:54:29,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:29,741 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1112 transitions. [2023-11-29 02:54:29,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:54:29,741 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1112 transitions. [2023-11-29 02:54:29,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 02:54:29,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:29,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:54:29,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:29,943 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:54:29,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:29,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1359391133, now seen corresponding path program 1 times [2023-11-29 02:54:29,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:29,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51773031] [2023-11-29 02:54:29,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:54:29,944 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:29,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:29,944 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:54:30,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:54:30,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:30,207 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:30,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:54:30,261 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:30,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:30,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51773031] [2023-11-29 02:54:30,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51773031] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:54:30,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:54:30,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 02:54:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968963115] [2023-11-29 02:54:30,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:54:30,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:54:30,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:30,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:54:30,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:54:30,264 INFO L87 Difference]: Start difference. First operand 992 states and 1112 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:31,857 INFO L93 Difference]: Finished difference Result 1001 states and 1127 transitions. [2023-11-29 02:54:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:54:31,857 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 60 [2023-11-29 02:54:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:31,863 INFO L225 Difference]: With dead ends: 1001 [2023-11-29 02:54:31,863 INFO L226 Difference]: Without dead ends: 1001 [2023-11-29 02:54:31,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:54:31,864 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 6 mSDsluCounter, 2453 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:31,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3274 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 02:54:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2023-11-29 02:54:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1000. [2023-11-29 02:54:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 582 states have (on average 1.8745704467353952) internal successors, (1091), 990 states have internal predecessors, (1091), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:54:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1125 transitions. [2023-11-29 02:54:31,879 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1125 transitions. Word has length 60 [2023-11-29 02:54:31,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:31,879 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1125 transitions. [2023-11-29 02:54:31,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1125 transitions. [2023-11-29 02:54:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 02:54:31,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:31,880 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] [2023-11-29 02:54:31,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:32,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:32,080 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:54:32,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:32,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1231289238, now seen corresponding path program 2 times [2023-11-29 02:54:32,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:32,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921306446] [2023-11-29 02:54:32,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:54:32,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:54:32,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:32,082 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:32,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:32,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:54:32,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:54:32,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 02:54:32,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:32,488 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:32,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:54:32,621 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:32,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:32,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921306446] [2023-11-29 02:54:32,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921306446] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:54:32,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:54:32,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 02:54:32,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766906469] [2023-11-29 02:54:32,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:54:32,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:54:32,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:32,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:54:32,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:54:32,622 INFO L87 Difference]: Start difference. First operand 1000 states and 1125 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:54:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:35,803 INFO L93 Difference]: Finished difference Result 1015 states and 1151 transitions. [2023-11-29 02:54:35,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 02:54:35,804 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-11-29 02:54:35,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:35,809 INFO L225 Difference]: With dead ends: 1015 [2023-11-29 02:54:35,809 INFO L226 Difference]: Without dead ends: 1013 [2023-11-29 02:54:35,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 02:54:35,810 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 12 mSDsluCounter, 5727 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6548 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:35,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6548 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 02:54:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2023-11-29 02:54:35,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1009. [2023-11-29 02:54:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 591 states have (on average 1.8663282571912014) internal successors, (1103), 999 states have internal predecessors, (1103), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:54:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1137 transitions. [2023-11-29 02:54:35,827 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1137 transitions. Word has length 63 [2023-11-29 02:54:35,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:35,827 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1137 transitions. [2023-11-29 02:54:35,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:54:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1137 transitions. [2023-11-29 02:54:35,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 02:54:35,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:35,828 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] [2023-11-29 02:54:35,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-11-29 02:54:36,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:36,029 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:54:36,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2005504458, now seen corresponding path program 3 times [2023-11-29 02:54:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:36,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832533579] [2023-11-29 02:54:36,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 02:54:36,030 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:36,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:36,031 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 02:54:36,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:54:36,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 02:54:36,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:36,787 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:36,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:54:37,402 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:37,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:37,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832533579] [2023-11-29 02:54:37,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832533579] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:54:37,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:54:37,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 02:54:37,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648010176] [2023-11-29 02:54:37,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:54:37,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 02:54:37,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:37,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 02:54:37,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:54:37,404 INFO L87 Difference]: Start difference. First operand 1009 states and 1137 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:54:44,234 INFO L93 Difference]: Finished difference Result 1039 states and 1201 transitions. [2023-11-29 02:54:44,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 02:54:44,234 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2023-11-29 02:54:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:54:44,240 INFO L225 Difference]: With dead ends: 1039 [2023-11-29 02:54:44,240 INFO L226 Difference]: Without dead ends: 1036 [2023-11-29 02:54:44,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 02:54:44,241 INFO L413 NwaCegarLoop]: 819 mSDtfsCounter, 24 mSDsluCounter, 9798 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10617 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:54:44,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10617 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-11-29 02:54:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2023-11-29 02:54:44,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1027. [2023-11-29 02:54:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 609 states have (on average 1.8489326765188834) internal successors, (1126), 1017 states have internal predecessors, (1126), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:54:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1160 transitions. [2023-11-29 02:54:44,256 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1160 transitions. Word has length 69 [2023-11-29 02:54:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:54:44,256 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1160 transitions. [2023-11-29 02:54:44,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1160 transitions. [2023-11-29 02:54:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 02:54:44,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:54:44,257 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] [2023-11-29 02:54:44,263 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:44,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:44,458 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:54:44,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:54:44,458 INFO L85 PathProgramCache]: Analyzing trace with hash 416552074, now seen corresponding path program 4 times [2023-11-29 02:54:44,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:54:44,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833275018] [2023-11-29 02:54:44,459 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 02:54:44,459 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:44,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:54:44,460 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:44,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:44,796 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 02:54:44,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:54:44,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 02:54:44,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:45,189 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:45,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:54:46,609 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:46,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:54:46,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833275018] [2023-11-29 02:54:46,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833275018] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:54:46,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:54:46,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 02:54:46,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350750474] [2023-11-29 02:54:46,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:54:46,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 02:54:46,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:46,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 02:54:46,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 02:54:46,613 INFO L87 Difference]: Start difference. First operand 1027 states and 1160 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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:55:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:55:03,714 INFO L93 Difference]: Finished difference Result 1084 states and 1270 transitions. [2023-11-29 02:55:03,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 02:55:03,715 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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 81 [2023-11-29 02:55:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:55:03,719 INFO L225 Difference]: With dead ends: 1084 [2023-11-29 02:55:03,719 INFO L226 Difference]: Without dead ends: 1082 [2023-11-29 02:55:03,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 02:55:03,724 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 48 mSDsluCounter, 22105 mSDsCounter, 0 mSdLazyCounter, 6306 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 22926 SdHoareTripleChecker+Invalid, 6449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 6306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:55:03,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 22926 Invalid, 6449 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [143 Valid, 6306 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2023-11-29 02:55:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2023-11-29 02:55:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1061. [2023-11-29 02:55:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 643 states have (on average 1.822706065318818) internal successors, (1172), 1051 states have internal predecessors, (1172), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:55:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1206 transitions. [2023-11-29 02:55:03,753 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1206 transitions. Word has length 81 [2023-11-29 02:55:03,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:55:03,753 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1206 transitions. [2023-11-29 02:55:03,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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:55:03,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1206 transitions. [2023-11-29 02:55:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 02:55:03,755 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:55:03,755 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] [2023-11-29 02:55:03,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:55:03,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:55:03,955 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:55:03,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:55:03,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1285677802, now seen corresponding path program 5 times [2023-11-29 02:55:03,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:55:03,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015908336] [2023-11-29 02:55:03,957 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:55:03,957 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:55:03,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:55:03,957 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:55:03,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:55:05,326 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 02:55:05,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:55:05,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 02:55:05,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:55:05,384 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:55:05,384 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:55:05,759 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 02:55:05,759 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:55:05,836 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:55:06,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2023-11-29 02:55:08,453 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:55:08,454 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:55:08,534 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:55:08,610 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:55:08,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:55:08,978 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1651 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1651) |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 02:55:08,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:55:08,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015908336] [2023-11-29 02:55:08,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015908336] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:55:08,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [707398684] [2023-11-29 02:55:08,981 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:55:08,981 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:55:08,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:55:08,993 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:55:08,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-11-29 02:56:26,360 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 02:56:26,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:56:26,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 02:56:26,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:56:26,652 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:56:26,652 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:27,042 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 02:56:27,042 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:27,124 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:27,303 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:28,590 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:56:28,590 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:28,700 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:28,757 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:28,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:56:29,116 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2097 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2097) |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 02:56:29,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [707398684] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:56:29,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:56:29,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-11-29 02:56:29,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799968270] [2023-11-29 02:56:29,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:56:29,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 02:56:29,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:56:29,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 02:56:29,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=321, Unknown=2, NotChecked=74, Total=462 [2023-11-29 02:56:29,120 INFO L87 Difference]: Start difference. First operand 1061 states and 1206 transitions. Second operand has 18 states, 15 states have (on average 7.866666666666666) internal successors, (118), 17 states have internal predecessors, (118), 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:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:56:42,748 INFO L93 Difference]: Finished difference Result 2062 states and 2249 transitions. [2023-11-29 02:56:42,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 02:56:42,748 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.866666666666666) internal successors, (118), 17 states have internal predecessors, (118), 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 103 [2023-11-29 02:56:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:56:42,757 INFO L225 Difference]: With dead ends: 2062 [2023-11-29 02:56:42,757 INFO L226 Difference]: Without dead ends: 2058 [2023-11-29 02:56:42,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=215, Invalid=1051, Unknown=2, NotChecked=138, Total=1406 [2023-11-29 02:56:42,758 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 4004 mSDsluCounter, 4055 mSDsCounter, 0 mSdLazyCounter, 5956 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4004 SdHoareTripleChecker+Valid, 4466 SdHoareTripleChecker+Invalid, 6122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 5956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:56:42,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4004 Valid, 4466 Invalid, 6122 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [166 Valid, 5956 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2023-11-29 02:56:42,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2023-11-29 02:56:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1107. [2023-11-29 02:56:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 689 states have (on average 1.7677793904208998) internal successors, (1218), 1096 states have internal predecessors, (1218), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:56:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1252 transitions. [2023-11-29 02:56:42,779 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1252 transitions. Word has length 103 [2023-11-29 02:56:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:56:42,779 INFO L495 AbstractCegarLoop]: Abstraction has 1107 states and 1252 transitions. [2023-11-29 02:56:42,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.866666666666666) internal successors, (118), 17 states have internal predecessors, (118), 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:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1252 transitions. [2023-11-29 02:56:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 02:56:42,780 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:56:42,780 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:56:42,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:43,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-11-29 02:56:43,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:56:43,181 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:56:43,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:56:43,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1285677803, now seen corresponding path program 1 times [2023-11-29 02:56:43,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:56:43,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007179747] [2023-11-29 02:56:43,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:56:43,183 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:43,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:56:43,183 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:43,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:56:43,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 02:56:43,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:56:43,906 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:44,112 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:56:44,113 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:44,121 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 02:56:44,148 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:44,161 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:44,256 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:44,260 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:44,837 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:56:44,837 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:44,842 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:44,885 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:44,891 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:44,916 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:44,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:56:46,348 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |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:46,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:56:46,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007179747] [2023-11-29 02:56:46,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007179747] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:56:46,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1102789290] [2023-11-29 02:56:46,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:56:46,355 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:56:46,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:56:46,356 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:56:46,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 02:58:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:58:29,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 02:58:29,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:58:29,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:58:29,768 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:58:29,769 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:29,778 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 02:58:29,792 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:29,803 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:29,863 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:29,868 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:30,546 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:58:30,546 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:30,554 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:30,589 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:30,595 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:30,598 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:30,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:58:31,769 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3173 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:58:31,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1102789290] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:58:31,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:58:31,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 02:58:31,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625235656] [2023-11-29 02:58:31,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:58:31,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:58:31,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:58:31,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:58:31,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 02:58:31,779 INFO L87 Difference]: Start difference. First operand 1107 states and 1252 transitions. Second operand has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 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:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:58:41,923 INFO L93 Difference]: Finished difference Result 1450 states and 1563 transitions. [2023-11-29 02:58:41,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:58:41,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 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 103 [2023-11-29 02:58:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:58:41,933 INFO L225 Difference]: With dead ends: 1450 [2023-11-29 02:58:41,933 INFO L226 Difference]: Without dead ends: 1450 [2023-11-29 02:58:41,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 02:58:41,934 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 706 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 4225 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 4236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:58:41,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 2008 Invalid, 4236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 4225 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2023-11-29 02:58:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2023-11-29 02:58:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1106. [2023-11-29 02:58:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 689 states have (on average 1.7663280116110305) internal successors, (1217), 1095 states have internal predecessors, (1217), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:58:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1251 transitions. [2023-11-29 02:58:41,960 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1251 transitions. Word has length 103 [2023-11-29 02:58:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:58:41,960 INFO L495 AbstractCegarLoop]: Abstraction has 1106 states and 1251 transitions. [2023-11-29 02:58:41,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 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:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1251 transitions. [2023-11-29 02:58:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 02:58:41,962 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:58:41,962 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] [2023-11-29 02:58:41,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 02:58:42,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-29 02:58:42,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:58:42,363 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:58:42,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:58:42,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1412521084, now seen corresponding path program 1 times [2023-11-29 02:58:42,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:58:42,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221238915] [2023-11-29 02:58:42,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:58:42,364 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:42,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:58:42,365 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:42,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:58:43,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 02:58:43,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:58:43,148 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:43,256 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:58:43,256 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 02:58:43,285 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:43,375 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 02:58:44,218 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:58:44,218 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 02:58:44,314 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:58:44,314 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 02:58:44,331 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 02:58:44,367 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:44,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:58:44,420 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3580) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-11-29 02:58:44,430 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3580 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:58:44,798 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3580 (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$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3626))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3580)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:58:44,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:58:44,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221238915] [2023-11-29 02:58:44,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221238915] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:58:44,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [639061685] [2023-11-29 02:58:44,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:58:44,801 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:58:44,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:58:44,802 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:58:44,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 02:58:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:58:48,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 02:58:48,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:58:48,612 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:58:48,612 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:58:48,963 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 02:58:48,963 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:58:49,023 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:58:49,197 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:58:50,384 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:58:50,385 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:58:50,581 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:58:50,582 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:58:50,604 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:58:50,659 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:50,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:58:50,673 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4033) |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 02:58:50,684 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4033 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4033) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:58:51,002 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4033 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4033)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 02:58:51,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [639061685] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:58:51,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:58:51,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2023-11-29 02:58:51,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234803519] [2023-11-29 02:58:51,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:58:51,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 02:58:51,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:58:51,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 02:58:51,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=342, Unknown=6, NotChecked=258, Total=702 [2023-11-29 02:58:51,007 INFO L87 Difference]: Start difference. First operand 1106 states and 1251 transitions. Second operand has 19 states, 16 states have (on average 7.625) internal successors, (122), 19 states have internal predecessors, (122), 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:59:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:02,402 INFO L93 Difference]: Finished difference Result 2054 states and 2237 transitions. [2023-11-29 02:59:02,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 02:59:02,403 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.625) internal successors, (122), 19 states have internal predecessors, (122), 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 105 [2023-11-29 02:59:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:02,412 INFO L225 Difference]: With dead ends: 2054 [2023-11-29 02:59:02,412 INFO L226 Difference]: Without dead ends: 2054 [2023-11-29 02:59:02,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=445, Unknown=6, NotChecked=294, Total=870 [2023-11-29 02:59:02,413 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 2984 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 4770 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3004 SdHoareTripleChecker+Valid, 3621 SdHoareTripleChecker+Invalid, 4835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:02,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3004 Valid, 3621 Invalid, 4835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4770 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2023-11-29 02:59:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2023-11-29 02:59:02,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1105. [2023-11-29 02:59:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 689 states have (on average 1.7648766328011611) internal successors, (1216), 1094 states have internal predecessors, (1216), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:59:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1250 transitions. [2023-11-29 02:59:02,431 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1250 transitions. Word has length 105 [2023-11-29 02:59:02,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:02,431 INFO L495 AbstractCegarLoop]: Abstraction has 1105 states and 1250 transitions. [2023-11-29 02:59:02,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.625) internal successors, (122), 19 states have internal predecessors, (122), 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:59:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1250 transitions. [2023-11-29 02:59:02,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 02:59:02,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:02,432 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] [2023-11-29 02:59:02,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 02:59:02,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-11-29 02:59:02,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:59:02,833 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:59:02,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:02,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1412521083, now seen corresponding path program 1 times [2023-11-29 02:59:02,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:59:02,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315636223] [2023-11-29 02:59:02,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:02,835 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:59:02,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:59:02,836 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:59:02,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:59:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:03,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 02:59:03,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:59:03,731 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:59:03,822 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:59:03,822 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:59:03,829 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 02:59:03,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:59:03,854 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:59:03,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 02:59:03,963 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:59:04,592 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:59:04,593 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:59:04,598 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:59:04,714 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:59:04,714 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:59:04,726 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:59:04,739 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:59:04,746 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:59:04,771 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:59:04,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:59:04,923 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:59:04,960 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4533) |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:59:06,269 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4624))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4625) .cse0 v_ArrVal_4533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4625) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4533) |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:59:06,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:59:06,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315636223] [2023-11-29 02:59:06,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315636223] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:59:06,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1792701638] [2023-11-29 02:59:06,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:06,278 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:59:06,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:59:06,279 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:59:06,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 02:59:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:10,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 02:59:10,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:59:10,213 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:59:10,437 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:59:10,452 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:59:10,453 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:59:10,511 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:59:10,515 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:59:10,676 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:59:10,681 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:59:11,277 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:59:11,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:59:11,285 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:59:11,417 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:59:11,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:59:11,423 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:59:11,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:59:11,443 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:59:11,444 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:59:11,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:59:11,489 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-11-29 02:59:11,520 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5079) |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:59:12,797 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5171))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5172) .cse0 v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5172) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5171) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd .cse3 (_ bv8 32))))))) is different from false [2023-11-29 02:59:12,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1792701638] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:59:12,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:59:12,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 02:59:12,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568083238] [2023-11-29 02:59:12,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:59:12,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 02:59:12,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:59:12,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 02:59:12,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 02:59:12,807 INFO L87 Difference]: Start difference. First operand 1105 states and 1250 transitions. Second operand has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 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 02:59:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:59:24,001 INFO L93 Difference]: Finished difference Result 1458 states and 1572 transitions. [2023-11-29 02:59:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:59:24,001 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 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 105 [2023-11-29 02:59:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:59:24,007 INFO L225 Difference]: With dead ends: 1458 [2023-11-29 02:59:24,007 INFO L226 Difference]: Without dead ends: 1458 [2023-11-29 02:59:24,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 02:59:24,008 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 1126 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 5237 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 5258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:59:24,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 2094 Invalid, 5258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5237 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2023-11-29 02:59:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2023-11-29 02:59:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1104. [2023-11-29 02:59:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 689 states have (on average 1.7634252539912918) internal successors, (1215), 1093 states have internal predecessors, (1215), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:59:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1249 transitions. [2023-11-29 02:59:24,023 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1249 transitions. Word has length 105 [2023-11-29 02:59:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:59:24,024 INFO L495 AbstractCegarLoop]: Abstraction has 1104 states and 1249 transitions. [2023-11-29 02:59:24,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 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 02:59:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1249 transitions. [2023-11-29 02:59:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 02:59:24,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:59:24,025 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] [2023-11-29 02:59:24,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 02:59:24,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:59:24,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:59:24,426 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 02:59:24,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:59:24,426 INFO L85 PathProgramCache]: Analyzing trace with hash -221409288, now seen corresponding path program 1 times [2023-11-29 02:59:24,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:59:24,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691183826] [2023-11-29 02:59:24,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:24,427 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:59:24,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:59:24,427 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:59:24,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:59:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:25,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 02:59:25,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:59:25,372 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:59:25,471 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:59:25,471 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 02:59:25,495 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:59:25,586 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 02:59:26,362 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:59:26,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 02:59:26,464 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:59:26,464 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 02:59:26,547 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:59:26,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:59:26,564 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 02:59:26,600 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:59:26,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:59:30,712 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5595 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5595) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 02:59:30,726 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5594))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5595)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 02:59:30,741 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5594))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5595)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 02:59:31,153 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5595 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5641))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5594)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5595)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:59:31,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:59:31,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691183826] [2023-11-29 02:59:31,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691183826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:59:31,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [638804282] [2023-11-29 02:59:31,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:59:31,157 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:59:31,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:59:31,158 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:59:31,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 02:59:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:59:46,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 02:59:46,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:59:46,883 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:59:46,883 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:59:47,405 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 02:59:47,405 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:59:47,491 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:59:47,718 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:59:49,138 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:59:49,138 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:59:49,374 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:59:49,375 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:59:49,531 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:59:49,532 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:59:49,553 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:59:49,631 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:59:49,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:59:53,719 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5595 (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6064))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5595)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:59:53,734 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5595 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6064))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5595)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:59:54,138 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5595 (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$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6111))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6064)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5595)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:59:54,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [638804282] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:59:54,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:59:54,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2023-11-29 02:59:54,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050986539] [2023-11-29 02:59:54,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:59:54,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 02:59:54,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:59:54,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 02:59:54,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=456, Unknown=8, NotChecked=350, Total=930 [2023-11-29 02:59:54,145 INFO L87 Difference]: Start difference. First operand 1104 states and 1249 transitions. Second operand has 21 states, 18 states have (on average 7.0) internal successors, (126), 21 states have internal predecessors, (126), 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:10,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:00:10,705 INFO L93 Difference]: Finished difference Result 2050 states and 2233 transitions. [2023-11-29 03:00:10,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 03:00:10,706 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.0) internal successors, (126), 21 states have internal predecessors, (126), 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 107 [2023-11-29 03:00:10,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:00:10,711 INFO L225 Difference]: With dead ends: 2050 [2023-11-29 03:00:10,711 INFO L226 Difference]: Without dead ends: 2050 [2023-11-29 03:00:10,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=146, Invalid=576, Unknown=8, NotChecked=392, Total=1122 [2023-11-29 03:00:10,712 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 2963 mSDsluCounter, 3998 mSDsCounter, 0 mSdLazyCounter, 5851 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2983 SdHoareTripleChecker+Valid, 4412 SdHoareTripleChecker+Invalid, 5916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 5851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:00:10,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2983 Valid, 4412 Invalid, 5916 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 5851 Invalid, 0 Unknown, 0 Unchecked, 16.2s Time] [2023-11-29 03:00:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2023-11-29 03:00:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1103. [2023-11-29 03:00:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 689 states have (on average 1.7619738751814225) internal successors, (1214), 1092 states have internal predecessors, (1214), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:00:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1248 transitions. [2023-11-29 03:00:10,729 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1248 transitions. Word has length 107 [2023-11-29 03:00:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:00:10,729 INFO L495 AbstractCegarLoop]: Abstraction has 1103 states and 1248 transitions. [2023-11-29 03:00:10,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.0) internal successors, (126), 21 states have internal predecessors, (126), 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:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1248 transitions. [2023-11-29 03:00:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 03:00:10,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:00:10,731 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] [2023-11-29 03:00:10,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 03:00:10,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:00:11,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:11,131 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 03:00:11,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:00:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash -221409287, now seen corresponding path program 1 times [2023-11-29 03:00:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:00:11,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673456733] [2023-11-29 03:00:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:11,132 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:11,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:00:11,133 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:11,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:00:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:00:12,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 03:00:12,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:00:12,104 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:12,236 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:00:12,236 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:12,245 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:00:12,280 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:00:12,292 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:12,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 03:00:12,411 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:00:13,176 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:00:13,176 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:00:13,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:00:13,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:00:13,325 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:00:13,340 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:00:13,437 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:00:13,438 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:00:13,453 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:00:13,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 03:00:13,471 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:00:13,510 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:13,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:00:13,692 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6581) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:00:13,729 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6581) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:00:13,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6580) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6579))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6580) .cse2 v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6581) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:00:13,957 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6579))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6580) .cse1 v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6581) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6580) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 03:00:15,322 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6674 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6674))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6579))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6673) .cse0 v_ArrVal_6580) .cse1 v_ArrVal_6582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6581) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6674 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6674))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6673) .cse6 v_ArrVal_6580) (select (select (store .cse7 .cse6 v_ArrVal_6579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6582))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 03:00:15,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:00:15,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673456733] [2023-11-29 03:00:15,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673456733] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:00:15,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [542627420] [2023-11-29 03:00:15,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:15,337 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:00:15,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:00:15,338 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:00:15,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 03:00:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:00:32,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 03:00:32,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:00:32,420 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,745 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:00:32,745 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:32,755 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:00:32,822 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:32,838 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:33,028 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:33,033 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:33,739 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:00:33,739 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:33,749 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:33,933 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:00:33,933 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:33,941 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:34,062 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:00:34,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 03:00:34,071 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:34,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:00:34,092 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:34,099 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:34,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:00:34,153 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7145) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:00:34,186 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7145) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:00:34,308 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7143))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7144) .cse0 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7145) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7144) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 03:00:34,437 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7143))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7144) .cse1 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7145) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7144) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 03:00:36,188 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7237))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7143))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7238) .cse0 v_ArrVal_7144) .cse1 v_ArrVal_7146) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7145) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7237))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7238) .cse6 v_ArrVal_7144) (select (select (store .cse7 .cse6 v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7146))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 03:00:36,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [542627420] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:00:36,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:00:36,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 03:00:36,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536067000] [2023-11-29 03:00:36,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:00:36,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 03:00:36,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:00:36,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 03:00:36,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 03:00:36,207 INFO L87 Difference]: Start difference. First operand 1103 states and 1248 transitions. Second operand has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 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:01:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:01:00,684 INFO L93 Difference]: Finished difference Result 1456 states and 1570 transitions. [2023-11-29 03:01:00,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:01:00,685 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 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 107 [2023-11-29 03:01:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:01:00,689 INFO L225 Difference]: With dead ends: 1456 [2023-11-29 03:01:00,689 INFO L226 Difference]: Without dead ends: 1456 [2023-11-29 03:01:00,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 03:01:00,690 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 1815 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 7296 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1833 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 7329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 7296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:01:00,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1833 Valid, 2640 Invalid, 7329 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 7296 Invalid, 0 Unknown, 0 Unchecked, 23.9s Time] [2023-11-29 03:01:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2023-11-29 03:01:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1102. [2023-11-29 03:01:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 689 states have (on average 1.760522496371553) internal successors, (1213), 1091 states have internal predecessors, (1213), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:01:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1247 transitions. [2023-11-29 03:01:00,705 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1247 transitions. Word has length 107 [2023-11-29 03:01:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:01:00,706 INFO L495 AbstractCegarLoop]: Abstraction has 1102 states and 1247 transitions. [2023-11-29 03:01:00,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 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:01:00,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1247 transitions. [2023-11-29 03:01:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 03:01:00,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:01:00,707 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:01:00,720 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:01:00,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2023-11-29 03:01:01,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:01:01,108 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 03:01:01,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:01:01,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1975721351, now seen corresponding path program 1 times [2023-11-29 03:01:01,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:01:01,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099229622] [2023-11-29 03:01:01,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:01:01,109 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:01,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:01:01,110 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:01,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:01:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:01:02,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 03:01:02,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:01:02,214 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:02,420 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:01:02,420 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:01:02,473 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:02,605 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:01:03,913 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:01:03,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:01:04,067 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:01:04,068 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:01:04,197 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:01:04,198 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:01:04,337 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:01:04,337 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:01:04,356 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:01:04,422 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:04,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:01:04,520 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7677) |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:01:04,538 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7677 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:01:04,558 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (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$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7676))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:01:04,578 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7676))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:01:04,601 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7675 (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7675))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7676)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:01:04,625 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7675 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7675))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7676)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:01:05,136 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7723 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7723))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7675)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7676)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7677)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:01:05,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:01:05,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099229622] [2023-11-29 03:01:05,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099229622] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:01:05,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1939912474] [2023-11-29 03:01:05,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:01:05,143 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:01:05,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:01:05,144 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:01:05,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 03:01:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:01:25,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 03:01:25,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:01:25,522 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:01:25,523 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:26,295 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:01:26,296 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:26,435 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:26,760 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:28,799 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:01:28,799 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:29,121 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:01:29,121 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:29,330 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:01:29,331 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:29,566 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:01:29,567 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:29,601 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:29,724 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:29,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:01:33,890 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8162 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8162) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-11-29 03:01:33,911 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8161 (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$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8161))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:01:33,931 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8161 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8161))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:01:33,956 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8160 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8160))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8161)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 03:01:33,982 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8160 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8160))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8161)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:01:34,508 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8160 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8208 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8208))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8160)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8161)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8162)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:01:34,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1939912474] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:01:34,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:01:34,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2023-11-29 03:01:34,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906378552] [2023-11-29 03:01:34,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:01:34,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 03:01:34,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:01:34,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 03:01:34,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=543, Unknown=17, NotChecked=780, Total=1482 [2023-11-29 03:01:34,516 INFO L87 Difference]: Start difference. First operand 1102 states and 1247 transitions. Second operand has 23 states, 20 states have (on average 6.5) internal successors, (130), 23 states have internal predecessors, (130), 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:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:01:59,955 INFO L93 Difference]: Finished difference Result 2046 states and 2229 transitions. [2023-11-29 03:01:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 03:01:59,956 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.5) internal successors, (130), 23 states have internal predecessors, (130), 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 109 [2023-11-29 03:01:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:01:59,959 INFO L225 Difference]: With dead ends: 2046 [2023-11-29 03:01:59,959 INFO L226 Difference]: Without dead ends: 2046 [2023-11-29 03:01:59,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=173, Invalid=674, Unknown=17, NotChecked=858, Total=1722 [2023-11-29 03:01:59,960 INFO L413 NwaCegarLoop]: 413 mSDtfsCounter, 1571 mSDsluCounter, 4869 mSDsCounter, 0 mSdLazyCounter, 7124 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 5282 SdHoareTripleChecker+Invalid, 7171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 7124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:01:59,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 5282 Invalid, 7171 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 7124 Invalid, 0 Unknown, 0 Unchecked, 25.0s Time] [2023-11-29 03:01:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2023-11-29 03:01:59,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1101. [2023-11-29 03:01:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 689 states have (on average 1.7590711175616836) internal successors, (1212), 1090 states have internal predecessors, (1212), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:01:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1246 transitions. [2023-11-29 03:01:59,978 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1246 transitions. Word has length 109 [2023-11-29 03:01:59,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:01:59,978 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1246 transitions. [2023-11-29 03:01:59,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.5) internal successors, (130), 23 states have internal predecessors, (130), 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:59,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1246 transitions. [2023-11-29 03:01:59,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 03:01:59,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:01:59,979 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:01:59,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:02:00,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 03:02:00,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:02:00,380 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 03:02:00,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:02:00,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1975721352, now seen corresponding path program 1 times [2023-11-29 03:02:00,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:02:00,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242612123] [2023-11-29 03:02:00,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:02:00,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:02:00,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:02:00,382 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:00,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:02:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:01,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 03:02:01,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:02:01,626 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:02,042 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:02:02,065 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:02:02,065 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:02,123 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:02,134 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:02,313 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:02,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:02:03,369 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:03,369 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:03,381 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:03,546 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:03,547 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:03,558 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:03,689 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:03,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:02:03,700 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:03,841 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:03,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:02:03,852 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:03,871 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:03,877 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:03,928 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:03,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:02:04,151 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 03:02:04,204 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:02:04,313 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8694))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8693) .cse0 v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8693) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8695) |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:02:04,441 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8694))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8693) .cse1 v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8693) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-29 03:02:05,509 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8692))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8694))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8691) .cse0 v_ArrVal_8693) .cse1 v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8692))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8691) .cse6 v_ArrVal_8693) (select (select (store .cse7 .cse6 v_ArrVal_8694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8695))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 03:02:06,695 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8692))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8694))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8691) .cse1 v_ArrVal_8693) .cse2 v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8692))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8691) .cse7 v_ArrVal_8693) (select (select (store .cse8 .cse7 v_ArrVal_8694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8695))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 03:02:12,863 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8696 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8787))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8692))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8694))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8788) .cse0 v_ArrVal_8691) .cse1 v_ArrVal_8693) .cse2 v_ArrVal_8695) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8696) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_8694 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8788 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8695 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8787))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8692))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8788) .cse8 v_ArrVal_8691) .cse9 v_ArrVal_8693) (select (select (store .cse10 .cse9 v_ArrVal_8694) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8695))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 03:02:12,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:02:12,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242612123] [2023-11-29 03:02:12,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242612123] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:02:12,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [873876074] [2023-11-29 03:02:12,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:02:12,904 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:02:12,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:02:12,905 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:02:12,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 03:02:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:35,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 121 conjunts are in the unsatisfiable core [2023-11-29 03:02:36,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:02:36,047 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:38,222 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:02:38,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:02:38,318 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:38,418 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:38,443 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:38,846 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:38,871 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:43,530 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:43,530 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:43,581 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:44,063 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:44,064 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:44,113 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:44,474 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:44,474 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:44,523 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:44,840 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:44,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:02:44,891 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:45,007 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:45,033 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:45,080 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:45,080 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:02:45,294 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:02:45,420 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 03:02:45,555 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9275))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9274) .cse0 v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9274) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9277) |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:02:45,680 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9274) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9275))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9274) .cse3 v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:02:45,828 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9272))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9275))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9273) .cse0 v_ArrVal_9274) .cse1 v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9272))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9273) .cse6 v_ArrVal_9274) (select (select (store .cse7 .cse6 v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9277))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 03:02:45,984 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9272))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9275))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9273) .cse1 v_ArrVal_9274) .cse2 v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9272))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9273) .cse7 v_ArrVal_9274) (select (select (store .cse8 .cse7 v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9277))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 03:02:49,830 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9368))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9272))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9275))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9369) .cse0 v_ArrVal_9273) .cse1 v_ArrVal_9274) .cse2 v_ArrVal_9277) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9276) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9368 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9368))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9272))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9369) .cse8 v_ArrVal_9273) .cse9 v_ArrVal_9274) (select (select (store .cse10 .cse9 v_ArrVal_9275) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9277))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 03:02:49,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [873876074] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:02:49,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:02:49,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-11-29 03:02:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815537950] [2023-11-29 03:02:49,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:02:49,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 03:02:49,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:02:49,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 03:02:49,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=160, Unknown=14, NotChecked=518, Total=756 [2023-11-29 03:02:49,851 INFO L87 Difference]: Start difference. First operand 1101 states and 1246 transitions. Second operand has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 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 03:04:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:04:12,186 INFO L93 Difference]: Finished difference Result 1444 states and 1557 transitions. [2023-11-29 03:04:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:04:12,187 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 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 109 [2023-11-29 03:04:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:04:12,189 INFO L225 Difference]: With dead ends: 1444 [2023-11-29 03:04:12,190 INFO L226 Difference]: Without dead ends: 1444 [2023-11-29 03:04:12,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=14, NotChecked=714, Total=1190 [2023-11-29 03:04:12,191 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 697 mSDsluCounter, 2270 mSDsCounter, 0 mSdLazyCounter, 6237 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 2756 SdHoareTripleChecker+Invalid, 6248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 6237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 80.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:04:12,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 2756 Invalid, 6248 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 6237 Invalid, 0 Unknown, 0 Unchecked, 80.3s Time] [2023-11-29 03:04:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2023-11-29 03:04:12,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1100. [2023-11-29 03:04:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 689 states have (on average 1.7576197387518142) internal successors, (1211), 1089 states have internal predecessors, (1211), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:04:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1245 transitions. [2023-11-29 03:04:12,208 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1245 transitions. Word has length 109 [2023-11-29 03:04:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:04:12,209 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1245 transitions. [2023-11-29 03:04:12,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 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 03:04:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1245 transitions. [2023-11-29 03:04:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 03:04:12,210 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:04:12,210 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:04:12,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-11-29 03:04:12,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 03:04:12,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:04:12,611 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 03:04:12,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:04:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash 294403918, now seen corresponding path program 1 times [2023-11-29 03:04:12,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:04:12,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879916798] [2023-11-29 03:04:12,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:04:12,612 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:12,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:04:12,613 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:12,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-11-29 03:04:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:04:14,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-29 03:04:14,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:04:14,605 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 03:04:14,605 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 03:04:18,280 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:04:18,281 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 03:04:18,761 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:19,847 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 03:04:34,212 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:04:34,212 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 03:04:35,260 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:04:35,260 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 03:04:36,097 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:04:36,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2023-11-29 03:04:36,933 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:04:36,933 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 03:04:37,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:04:37,817 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 03:04:38,004 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 03:04:38,747 INFO L349 Elim1Store]: treesize reduction 44, result has 51.1 percent of original size [2023-11-29 03:04:38,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 73 [2023-11-29 03:04:40,154 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:40,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:04:40,998 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9826) |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:04:41,061 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9826) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:04:41,127 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9825 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9825))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9826)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:04:41,193 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9825 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9825))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9826)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:04:41,263 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9824 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9824))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9825)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9826)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:04:41,335 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9824 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9824))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9825)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9826)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:04:41,411 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9823 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9823))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9824)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9825)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9826)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:04:41,488 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9823 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9823))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9824)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9825)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9826)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:04:43,182 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9826 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9825 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9823 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9873))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9823)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9824)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9825)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9826)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 03:04:43,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:04:43,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879916798] [2023-11-29 03:04:43,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879916798] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:04:43,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [983769255] [2023-11-29 03:04:43,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:04:43,201 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:04:43,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:04:43,202 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:04:43,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 03:04:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:04:58,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 03:04:58,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:04:58,616 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:04:58,616 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:05:02,570 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:05:02,570 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:05:03,277 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:05:04,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 03:05:14,975 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:05:14,976 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:05:16,525 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:05:16,525 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:05:17,639 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:05:17,639 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:05:18,698 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:05:18,698 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:05:19,775 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:05:19,776 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:05:20,485 INFO L349 Elim1Store]: treesize reduction 94, result has 30.9 percent of original size [2023-11-29 03:05:20,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 60 [2023-11-29 03:05:20,533 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:05:21,132 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:05:21,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:05:26,704 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10330) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 03:05:26,795 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1)) (v_ArrVal_10329 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10329))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:05:26,884 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1)) (v_ArrVal_10329 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10329))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:05:26,979 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1)) (v_ArrVal_10328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10329 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10328))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10329)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:05:27,080 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1)) (v_ArrVal_10328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10329 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10328))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10329)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:05:27,197 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1)) (v_ArrVal_10327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10329 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10327))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10328)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10329)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 03:05:27,305 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10330 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10331 (_ BitVec 1)) (v_ArrVal_10327 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10329 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10331) (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10327))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10328)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10329)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 03:05:29,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [983769255] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:05:29,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:05:29,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 25 [2023-11-29 03:05:29,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064275891] [2023-11-29 03:05:29,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:05:29,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 03:05:29,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:05:29,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 03:05:29,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=866, Unknown=28, NotChecked=1200, Total=2256 [2023-11-29 03:05:29,666 INFO L87 Difference]: Start difference. First operand 1100 states and 1245 transitions. Second operand has 27 states, 24 states have (on average 5.583333333333333) internal successors, (134), 25 states have internal predecessors, (134), 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:07:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:07:31,804 INFO L93 Difference]: Finished difference Result 2042 states and 2225 transitions. [2023-11-29 03:07:31,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 03:07:31,805 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 5.583333333333333) internal successors, (134), 25 states have internal predecessors, (134), 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 111 [2023-11-29 03:07:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:07:31,810 INFO L225 Difference]: With dead ends: 2042 [2023-11-29 03:07:31,811 INFO L226 Difference]: Without dead ends: 2042 [2023-11-29 03:07:31,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=439, Invalid=2677, Unknown=28, NotChecked=1968, Total=5112 [2023-11-29 03:07:31,813 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 3948 mSDsluCounter, 6080 mSDsCounter, 0 mSdLazyCounter, 8937 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 110.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3948 SdHoareTripleChecker+Valid, 6487 SdHoareTripleChecker+Invalid, 9106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 8937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 114.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:07:31,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3948 Valid, 6487 Invalid, 9106 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [169 Valid, 8937 Invalid, 0 Unknown, 0 Unchecked, 114.0s Time] [2023-11-29 03:07:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2023-11-29 03:07:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1099. [2023-11-29 03:07:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 689 states have (on average 1.7561683599419449) internal successors, (1210), 1088 states have internal predecessors, (1210), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 03:07:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1244 transitions. [2023-11-29 03:07:31,833 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1244 transitions. Word has length 111 [2023-11-29 03:07:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:07:31,833 INFO L495 AbstractCegarLoop]: Abstraction has 1099 states and 1244 transitions. [2023-11-29 03:07:31,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 5.583333333333333) internal successors, (134), 25 states have internal predecessors, (134), 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:07:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1244 transitions. [2023-11-29 03:07:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 03:07:31,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:07:31,834 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:07:31,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 03:07:32,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2023-11-29 03:07:32,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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:07:32,235 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 645 more)] === [2023-11-29 03:07:32,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:07:32,235 INFO L85 PathProgramCache]: Analyzing trace with hash 294403919, now seen corresponding path program 1 times [2023-11-29 03:07:32,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:07:32,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945282904] [2023-11-29 03:07:32,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:07:32,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:07:32,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:07:32,237 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:32,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-11-29 03:07:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:07:33,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 126 conjunts are in the unsatisfiable core [2023-11-29 03:07:33,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:07:33,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:07:35,182 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:07:35,182 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:07:35,277 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:07:35,512 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:07:35,587 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:07:36,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-11-29 03:07:36,501 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:07:44,963 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:07:44,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2023-11-29 03:07:44,992 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:07:45,895 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:07:45,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2023-11-29 03:07:45,947 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:07:46,663 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:07:46,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2023-11-29 03:07:46,691 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:07:47,457 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:07:47,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2023-11-29 03:07:47,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:07:48,242 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:07:48,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2023-11-29 03:07:48,343 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:07:48,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2023-11-29 03:07:48,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:07:48,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:07:48,521 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:07:48,750 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 03:07:48,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 03:07:48,988 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:07:48,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:07:50,240 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))) (forall ((v_ArrVal_10886 (_ BitVec 32))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:07:50,414 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|)))) (forall ((v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))) (forall ((v_ArrVal_10886 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:07:50,606 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10886 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10883))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10882) .cse0 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store .cse2 .cse0 v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|)))) (forall ((v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10882) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false [2023-11-29 03:07:51,583 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10882) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10886 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10883))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10882) .cse3 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store .cse4 .cse3 v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|)))))))) is different from false [2023-11-29 03:07:54,308 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10886 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10881))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10883))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10880) .cse0 v_ArrVal_10882) .cse1 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store .cse3 .cse1 v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) (or (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10881))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10880) .cse6 v_ArrVal_10882) (select (select (store .cse7 .cse6 v_ArrVal_10883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10885))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv4 32) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))))) is different from false [2023-11-29 03:08:02,836 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10886 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10879))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_10881))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_10883))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_10878) .cse1 v_ArrVal_10880) .cse2 v_ArrVal_10882) .cse3 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store .cse5 .cse3 v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))))) (or (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10879))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_10881))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_10878) .cse9 v_ArrVal_10880) .cse10 v_ArrVal_10882) (select (select (store .cse11 .cse10 v_ArrVal_10883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10885))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse8 (bvadd .cse8 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|)))))))) is different from false [2023-11-29 03:08:10,726 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|)))) (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10977 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10978))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_10879))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_10881))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10977) .cse1 v_ArrVal_10878) .cse2 v_ArrVal_10880) .cse3 v_ArrVal_10882) (select (select (store .cse4 .cse3 v_ArrVal_10883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_10885))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_18| (_ BitVec 32)) (v_ArrVal_10883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10977 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10978 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_18|))) (forall ((v_ArrVal_10886 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10978))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_10879))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_10881))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_10883))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10977) .cse8 v_ArrVal_10878) .cse9 v_ArrVal_10880) .cse10 v_ArrVal_10882) .cse11 v_ArrVal_10885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc40#1.base_18| v_ArrVal_10886) (select (select (store .cse12 .cse11 v_ArrVal_10884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))))) is different from false [2023-11-29 03:08:10,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:08:10,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945282904] [2023-11-29 03:08:10,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945282904] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:08:10,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [875225327] [2023-11-29 03:08:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:08:10,791 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:08:10,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:08:10,792 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:08:10,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_547a6603-bcc3-4f63-b296-270c2e3b037d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process