./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-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_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/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_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/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_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:38:46,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:38:46,637 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-28 20:38:46,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:38:46,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:38:46,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:38:46,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:38:46,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:38:46,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:38:46,673 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:38:46,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:38:46,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:38:46,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:38:46,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:38:46,676 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:38:46,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:38:46,677 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:38:46,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:38:46,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:38:46,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:38:46,679 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 20:38:46,680 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 20:38:46,681 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 20:38:46,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:38:46,682 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:38:46,682 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:38:46,683 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:38:46,683 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:38:46,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:38:46,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:38:46,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:38:46,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:38:46,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:38:46,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:38:46,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:38:46,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:38:46,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:38:46,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:38:46,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:38:46,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:38:46,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:38:46,687 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_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/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_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2023-11-28 20:38:46,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:38:46,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:38:46,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:38:46,969 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:38:46,969 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:38:46,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2023-11-28 20:38:49,783 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:38:50,032 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:38:50,033 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2023-11-28 20:38:50,050 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/data/1739fea6e/58e9a4e587b54dff9d348ad90738fb1c/FLAG1c875b567 [2023-11-28 20:38:50,065 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/data/1739fea6e/58e9a4e587b54dff9d348ad90738fb1c [2023-11-28 20:38:50,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:38:50,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:38:50,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:38:50,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:38:50,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:38:50,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:38:50" (1/1) ... [2023-11-28 20:38:50,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd160e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:50, skipping insertion in model container [2023-11-28 20:38:50,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:38:50" (1/1) ... [2023-11-28 20:38:50,134 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:38:50,541 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:38:50,554 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-28 20:38:50,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@48250e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:50, skipping insertion in model container [2023-11-28 20:38:50,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:38:50,555 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-28 20:38:50,557 INFO L158 Benchmark]: Toolchain (without parser) took 486.29ms. Allocated memory is still 130.0MB. Free memory was 92.1MB in the beginning and 75.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-28 20:38:50,557 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 130.0MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:38:50,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.84ms. Allocated memory is still 130.0MB. Free memory was 91.7MB in the beginning and 75.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-28 20:38:50,559 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.23ms. Allocated memory is still 130.0MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.84ms. Allocated memory is still 130.0MB. Free memory was 91.7MB in the beginning and 75.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 738]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/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_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/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_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:38:52,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:38:52,466 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-28 20:38:52,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:38:52,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:38:52,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:38:52,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:38:52,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:38:52,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:38:52,512 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:38:52,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:38:52,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:38:52,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:38:52,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:38:52,515 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:38:52,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:38:52,516 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:38:52,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:38:52,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:38:52,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:38:52,518 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 20:38:52,519 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 20:38:52,520 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 20:38:52,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:38:52,521 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:38:52,521 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:38:52,521 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:38:52,522 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:38:52,522 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:38:52,523 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:38:52,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:38:52,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:38:52,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:38:52,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:38:52,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:38:52,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:38:52,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:38:52,525 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:38:52,526 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:38:52,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:38:52,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:38:52,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:38:52,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:38:52,527 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:38:52,527 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_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/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_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2023-11-28 20:38:52,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:38:52,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:38:52,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:38:52,846 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:38:52,847 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:38:52,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2023-11-28 20:38:55,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:38:55,955 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:38:55,956 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2023-11-28 20:38:55,974 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/data/589ccdd48/019358e5a4a948119df20da3beef2b7b/FLAGf527b9f53 [2023-11-28 20:38:55,989 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/data/589ccdd48/019358e5a4a948119df20da3beef2b7b [2023-11-28 20:38:55,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:38:55,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:38:55,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:38:55,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:38:55,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:38:56,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:38:55" (1/1) ... [2023-11-28 20:38:56,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@658bd73c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56, skipping insertion in model container [2023-11-28 20:38:56,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:38:55" (1/1) ... [2023-11-28 20:38:56,069 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:38:56,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:38:56,530 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-28 20:38:56,541 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:38:56,615 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:38:56,620 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:38:56,677 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:38:56,718 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:38:56,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56 WrapperNode [2023-11-28 20:38:56,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:38:56,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:38:56,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:38:56,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:38:56,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56" (1/1) ... [2023-11-28 20:38:56,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56" (1/1) ... [2023-11-28 20:38:56,794 INFO L138 Inliner]: procedures = 180, calls = 177, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 591 [2023-11-28 20:38:56,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:38:56,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:38:56,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:38:56,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:38:56,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56" (1/1) ... [2023-11-28 20:38:56,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56" (1/1) ... [2023-11-28 20:38:56,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56" (1/1) ... [2023-11-28 20:38:56,881 INFO L175 MemorySlicer]: Split 163 memory accesses to 3 slices as follows [2, 156, 5]. 96 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 43 writes are split as follows [0, 42, 1]. [2023-11-28 20:38:56,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56" (1/1) ... [2023-11-28 20:38:56,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56" (1/1) ... [2023-11-28 20:38:56,918 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56" (1/1) ... [2023-11-28 20:38:56,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56" (1/1) ... [2023-11-28 20:38:56,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56" (1/1) ... [2023-11-28 20:38:56,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56" (1/1) ... [2023-11-28 20:38:56,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:38:56,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:38:56,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:38:56,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:38:56,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56" (1/1) ... [2023-11-28 20:38:56,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:38:56,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:38:56,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:38:57,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:38:57,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-28 20:38:57,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-28 20:38:57,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-28 20:38:57,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-28 20:38:57,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-28 20:38:57,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-28 20:38:57,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-28 20:38:57,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-28 20:38:57,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-28 20:38:57,020 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-28 20:38:57,020 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-28 20:38:57,020 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-28 20:38:57,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-28 20:38:57,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:38:57,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:38:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-28 20:38:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-28 20:38:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-28 20:38:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-28 20:38:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-28 20:38:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-28 20:38:57,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:38:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-28 20:38:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-28 20:38:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-28 20:38:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:38:57,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-28 20:38:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-28 20:38:57,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:38:57,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:38:57,196 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:38:57,198 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:38:57,201 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 20:38:57,248 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 20:38:57,269 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 20:38:59,965 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:39:00,103 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:39:00,103 INFO L309 CfgBuilder]: Removed 31 assume(true) statements. [2023-11-28 20:39:00,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:00 BoogieIcfgContainer [2023-11-28 20:39:00,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:39:00,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:39:00,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:39:00,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:39:00,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:38:55" (1/3) ... [2023-11-28 20:39:00,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfa4d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:39:00, skipping insertion in model container [2023-11-28 20:39:00,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:56" (2/3) ... [2023-11-28 20:39:00,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfa4d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:39:00, skipping insertion in model container [2023-11-28 20:39:00,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:39:00" (3/3) ... [2023-11-28 20:39:00,113 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test1-1.i [2023-11-28 20:39:00,133 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:39:00,134 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 330 error locations. [2023-11-28 20:39:00,209 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:39:00,216 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;@4b51dfa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:39:00,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 330 error locations. [2023-11-28 20:39:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 584 states, 252 states have (on average 2.5476190476190474) internal successors, (642), 579 states have internal predecessors, (642), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-28 20:39:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-28 20:39:00,229 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:00,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-28 20:39:00,230 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:00,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:00,235 INFO L85 PathProgramCache]: Analyzing trace with hash 30453453, now seen corresponding path program 1 times [2023-11-28 20:39:00,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:00,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486275428] [2023-11-28 20:39:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:00,248 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-28 20:39:00,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:00,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:00,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:00,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-28 20:39:00,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:00,441 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-28 20:39:00,442 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:00,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:00,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486275428] [2023-11-28 20:39:00,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486275428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:00,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:00,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:39:00,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271753894] [2023-11-28 20:39:00,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:00,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:39:00,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:00,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:39:00,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:39:00,475 INFO L87 Difference]: Start difference. First operand has 584 states, 252 states have (on average 2.5476190476190474) internal successors, (642), 579 states have internal predecessors, (642), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:00,959 INFO L93 Difference]: Finished difference Result 574 states and 601 transitions. [2023-11-28 20:39:00,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:39:00,962 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-28 20:39:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:00,978 INFO L225 Difference]: With dead ends: 574 [2023-11-28 20:39:00,979 INFO L226 Difference]: Without dead ends: 573 [2023-11-28 20:39:00,980 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-28 20:39:00,984 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:00,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 533 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-28 20:39:00,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2023-11-28 20:39:01,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2023-11-28 20:39:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 247 states have (on average 2.4048582995951415) internal successors, (594), 568 states have internal predecessors, (594), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-28 20:39:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 600 transitions. [2023-11-28 20:39:01,045 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 600 transitions. Word has length 4 [2023-11-28 20:39:01,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:01,045 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 600 transitions. [2023-11-28 20:39:01,046 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-28 20:39:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 600 transitions. [2023-11-28 20:39:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-28 20:39:01,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:01,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-28 20:39:01,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:01,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:01,247 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:01,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:01,248 INFO L85 PathProgramCache]: Analyzing trace with hash 30453515, now seen corresponding path program 1 times [2023-11-28 20:39:01,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:01,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425694561] [2023-11-28 20:39:01,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:01,249 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-28 20:39:01,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:01,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:01,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:01,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:39:01,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:01,397 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-28 20:39:01,410 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-28 20:39:01,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:01,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:01,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425694561] [2023-11-28 20:39:01,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425694561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:01,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:01,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:39:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340273666] [2023-11-28 20:39:01,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:01,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:01,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:01,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:01,414 INFO L87 Difference]: Start difference. First operand 573 states and 600 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-28 20:39:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:02,757 INFO L93 Difference]: Finished difference Result 534 states and 562 transitions. [2023-11-28 20:39:02,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:02,759 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-28 20:39:02,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:02,763 INFO L225 Difference]: With dead ends: 534 [2023-11-28 20:39:02,764 INFO L226 Difference]: Without dead ends: 534 [2023-11-28 20:39:02,764 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-28 20:39:02,766 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 515 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:02,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 245 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-28 20:39:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-11-28 20:39:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 524. [2023-11-28 20:39:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 247 states have (on average 2.2064777327935223) internal successors, (545), 519 states have internal predecessors, (545), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-28 20:39:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 551 transitions. [2023-11-28 20:39:02,792 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 551 transitions. Word has length 4 [2023-11-28 20:39:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:02,793 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 551 transitions. [2023-11-28 20:39:02,793 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-28 20:39:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 551 transitions. [2023-11-28 20:39:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-28 20:39:02,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:02,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-28 20:39:02,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:02,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:02,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:02,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash 30453516, now seen corresponding path program 1 times [2023-11-28 20:39:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:02,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504478142] [2023-11-28 20:39:02,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:02,998 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-28 20:39:02,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:03,000 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:03,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:03,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:39:03,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:03,086 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-28 20:39:03,108 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-28 20:39:03,108 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:03,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:03,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504478142] [2023-11-28 20:39:03,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504478142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:03,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:03,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:39:03,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148886312] [2023-11-28 20:39:03,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:03,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:03,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:03,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:03,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:03,110 INFO L87 Difference]: Start difference. First operand 524 states and 551 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-28 20:39:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:04,728 INFO L93 Difference]: Finished difference Result 583 states and 614 transitions. [2023-11-28 20:39:04,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:04,730 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-28 20:39:04,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:04,732 INFO L225 Difference]: With dead ends: 583 [2023-11-28 20:39:04,732 INFO L226 Difference]: Without dead ends: 583 [2023-11-28 20:39:04,733 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-28 20:39:04,734 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 231 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:04,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 526 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-28 20:39:04,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2023-11-28 20:39:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 536. [2023-11-28 20:39:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 270 states have (on average 2.188888888888889) internal successors, (591), 531 states have internal predecessors, (591), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-28 20:39:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 597 transitions. [2023-11-28 20:39:04,748 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 597 transitions. Word has length 4 [2023-11-28 20:39:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:04,749 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 597 transitions. [2023-11-28 20:39:04,749 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-28 20:39:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 597 transitions. [2023-11-28 20:39:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-28 20:39:04,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:04,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:39:04,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:04,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:04,950 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:04,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:04,951 INFO L85 PathProgramCache]: Analyzing trace with hash 944887332, now seen corresponding path program 1 times [2023-11-28 20:39:04,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:04,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630785016] [2023-11-28 20:39:04,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:04,952 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-28 20:39:04,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:04,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:04,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:05,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 20:39:05,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:05,026 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-28 20:39:05,027 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:05,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:05,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630785016] [2023-11-28 20:39:05,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630785016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:05,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:05,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:39:05,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098103833] [2023-11-28 20:39:05,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:05,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:05,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:05,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:05,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:05,029 INFO L87 Difference]: Start difference. First operand 536 states and 597 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-28 20:39:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:05,904 INFO L93 Difference]: Finished difference Result 1053 states and 1174 transitions. [2023-11-28 20:39:05,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:05,906 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-28 20:39:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:05,911 INFO L225 Difference]: With dead ends: 1053 [2023-11-28 20:39:05,911 INFO L226 Difference]: Without dead ends: 1053 [2023-11-28 20:39:05,912 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-28 20:39:05,912 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 513 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:05,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 941 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-28 20:39:05,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2023-11-28 20:39:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 537. [2023-11-28 20:39:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 271 states have (on average 2.1845018450184504) internal successors, (592), 532 states have internal predecessors, (592), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-28 20:39:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 598 transitions. [2023-11-28 20:39:05,927 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 598 transitions. Word has length 5 [2023-11-28 20:39:05,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:05,928 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 598 transitions. [2023-11-28 20:39:05,928 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-28 20:39:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 598 transitions. [2023-11-28 20:39:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-28 20:39:05,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:05,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:05,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:06,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:06,129 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:06,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:06,130 INFO L85 PathProgramCache]: Analyzing trace with hash 882907778, now seen corresponding path program 1 times [2023-11-28 20:39:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:06,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623512919] [2023-11-28 20:39:06,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:06,131 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-28 20:39:06,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:06,132 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:06,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:06,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 20:39:06,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:06,252 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-28 20:39:06,252 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:06,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:06,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623512919] [2023-11-28 20:39:06,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623512919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:06,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:06,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:39:06,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232482875] [2023-11-28 20:39:06,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:06,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:06,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:06,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:06,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:06,255 INFO L87 Difference]: Start difference. First operand 537 states and 598 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:06,918 INFO L93 Difference]: Finished difference Result 498 states and 558 transitions. [2023-11-28 20:39:06,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:06,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-28 20:39:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:06,923 INFO L225 Difference]: With dead ends: 498 [2023-11-28 20:39:06,923 INFO L226 Difference]: Without dead ends: 498 [2023-11-28 20:39:06,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:06,924 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 70 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:06,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 799 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:39:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-11-28 20:39:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2023-11-28 20:39:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 256 states have (on average 2.15625) internal successors, (552), 493 states have internal predecessors, (552), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-28 20:39:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 558 transitions. [2023-11-28 20:39:06,935 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 558 transitions. Word has length 11 [2023-11-28 20:39:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:06,935 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 558 transitions. [2023-11-28 20:39:06,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 558 transitions. [2023-11-28 20:39:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-28 20:39:06,936 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:06,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:06,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-28 20:39:07,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:07,141 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:07,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:07,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1929153348, now seen corresponding path program 1 times [2023-11-28 20:39:07,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:07,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657600551] [2023-11-28 20:39:07,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:07,142 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-28 20:39:07,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:07,143 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:07,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:07,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:39:07,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:07,284 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-28 20:39:07,284 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:07,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:07,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657600551] [2023-11-28 20:39:07,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657600551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:07,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:07,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:39:07,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077729869] [2023-11-28 20:39:07,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:07,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:39:07,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:07,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:39:07,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:39:07,286 INFO L87 Difference]: Start difference. First operand 498 states and 558 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:07,954 INFO L93 Difference]: Finished difference Result 484 states and 537 transitions. [2023-11-28 20:39:07,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:39:07,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-28 20:39:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:07,958 INFO L225 Difference]: With dead ends: 484 [2023-11-28 20:39:07,958 INFO L226 Difference]: Without dead ends: 484 [2023-11-28 20:39:07,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:39:07,959 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 58 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:07,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1155 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:39:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2023-11-28 20:39:07,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 483. [2023-11-28 20:39:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 255 states have (on average 2.0784313725490198) internal successors, (530), 478 states have internal predecessors, (530), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-28 20:39:07,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 536 transitions. [2023-11-28 20:39:07,972 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 536 transitions. Word has length 13 [2023-11-28 20:39:07,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:07,973 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 536 transitions. [2023-11-28 20:39:07,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:07,973 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 536 transitions. [2023-11-28 20:39:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-28 20:39:07,974 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:07,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:07,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:08,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:08,175 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:08,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1037391286, now seen corresponding path program 1 times [2023-11-28 20:39:08,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:08,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610313340] [2023-11-28 20:39:08,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:08,176 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-28 20:39:08,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:08,177 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:08,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:08,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:39:08,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:08,301 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-28 20:39:08,387 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-28 20:39:08,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:08,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:08,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610313340] [2023-11-28 20:39:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610313340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:08,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:39:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894220424] [2023-11-28 20:39:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:08,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:39:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:08,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:39:08,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:39:08,389 INFO L87 Difference]: Start difference. First operand 483 states and 536 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:09,817 INFO L93 Difference]: Finished difference Result 489 states and 543 transitions. [2023-11-28 20:39:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:39:09,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-28 20:39:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:09,821 INFO L225 Difference]: With dead ends: 489 [2023-11-28 20:39:09,822 INFO L226 Difference]: Without dead ends: 489 [2023-11-28 20:39:09,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:39:09,823 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 448 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:09,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 359 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-28 20:39:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-11-28 20:39:09,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 479. [2023-11-28 20:39:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 255 states have (on average 2.062745098039216) internal successors, (526), 474 states have internal predecessors, (526), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-28 20:39:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 532 transitions. [2023-11-28 20:39:09,837 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 532 transitions. Word has length 27 [2023-11-28 20:39:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:09,838 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 532 transitions. [2023-11-28 20:39:09,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 532 transitions. [2023-11-28 20:39:09,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-28 20:39:09,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:09,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:09,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-28 20:39:10,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:10,041 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:10,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:10,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1037391285, now seen corresponding path program 1 times [2023-11-28 20:39:10,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:10,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353761051] [2023-11-28 20:39:10,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:10,042 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-28 20:39:10,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:10,043 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:10,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:10,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 20:39:10,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:10,150 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-28 20:39:10,330 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-28 20:39:10,330 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:10,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:10,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353761051] [2023-11-28 20:39:10,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353761051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:10,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:10,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:39:10,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548749007] [2023-11-28 20:39:10,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:10,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:39:10,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:10,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:39:10,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:39:10,332 INFO L87 Difference]: Start difference. First operand 479 states and 532 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:12,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:12,311 INFO L93 Difference]: Finished difference Result 522 states and 545 transitions. [2023-11-28 20:39:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:39:12,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-28 20:39:12,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:12,316 INFO L225 Difference]: With dead ends: 522 [2023-11-28 20:39:12,316 INFO L226 Difference]: Without dead ends: 522 [2023-11-28 20:39:12,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:39:12,317 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 167 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:12,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 651 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-28 20:39:12,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2023-11-28 20:39:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 475. [2023-11-28 20:39:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 255 states have (on average 2.0470588235294116) internal successors, (522), 470 states have internal predecessors, (522), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-28 20:39:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 528 transitions. [2023-11-28 20:39:12,325 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 528 transitions. Word has length 27 [2023-11-28 20:39:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:12,326 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 528 transitions. [2023-11-28 20:39:12,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 528 transitions. [2023-11-28 20:39:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-28 20:39:12,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:12,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:12,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-28 20:39:12,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:12,528 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:12,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:12,529 INFO L85 PathProgramCache]: Analyzing trace with hash -852507964, now seen corresponding path program 1 times [2023-11-28 20:39:12,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:12,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884449459] [2023-11-28 20:39:12,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:12,529 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-28 20:39:12,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:12,531 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:12,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:12,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:39:12,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:12,733 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-28 20:39:12,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:12,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:12,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884449459] [2023-11-28 20:39:12,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884449459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:12,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:12,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:39:12,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971999168] [2023-11-28 20:39:12,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:12,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:39:12,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:12,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:39:12,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:39:12,735 INFO L87 Difference]: Start difference. First operand 475 states and 528 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:13,374 INFO L93 Difference]: Finished difference Result 469 states and 518 transitions. [2023-11-28 20:39:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:39:13,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-11-28 20:39:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:13,379 INFO L225 Difference]: With dead ends: 469 [2023-11-28 20:39:13,379 INFO L226 Difference]: Without dead ends: 469 [2023-11-28 20:39:13,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:39:13,380 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 23 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:13,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1141 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:39:13,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2023-11-28 20:39:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2023-11-28 20:39:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 249 states have (on average 2.0562248995983934) internal successors, (512), 464 states have internal predecessors, (512), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-28 20:39:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 518 transitions. [2023-11-28 20:39:13,391 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 518 transitions. Word has length 43 [2023-11-28 20:39:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:13,392 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 518 transitions. [2023-11-28 20:39:13,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 518 transitions. [2023-11-28 20:39:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-28 20:39:13,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:13,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:13,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:13,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:13,595 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:13,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash 390722725, now seen corresponding path program 1 times [2023-11-28 20:39:13,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:13,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559563346] [2023-11-28 20:39:13,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:13,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:39:13,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:13,598 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:13,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:13,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:39:13,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:13,996 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-28 20:39:13,997 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:13,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:13,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559563346] [2023-11-28 20:39:13,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559563346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:13,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:13,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:39:13,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141001193] [2023-11-28 20:39:13,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:13,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:39:13,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:13,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:39:13,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:13,998 INFO L87 Difference]: Start difference. First operand 469 states and 518 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:14,522 INFO L93 Difference]: Finished difference Result 513 states and 562 transitions. [2023-11-28 20:39:14,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:39:14,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-11-28 20:39:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:14,526 INFO L225 Difference]: With dead ends: 513 [2023-11-28 20:39:14,527 INFO L226 Difference]: Without dead ends: 513 [2023-11-28 20:39:14,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:39:14,528 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 59 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:14,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 725 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-28 20:39:14,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2023-11-28 20:39:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2023-11-28 20:39:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 293 states have (on average 1.8976109215017065) internal successors, (556), 508 states have internal predecessors, (556), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-28 20:39:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 562 transitions. [2023-11-28 20:39:14,539 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 562 transitions. Word has length 47 [2023-11-28 20:39:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:14,540 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 562 transitions. [2023-11-28 20:39:14,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 562 transitions. [2023-11-28 20:39:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-28 20:39:14,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:14,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:14,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-28 20:39:14,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:14,742 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:14,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:14,743 INFO L85 PathProgramCache]: Analyzing trace with hash 551870377, now seen corresponding path program 1 times [2023-11-28 20:39:14,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:14,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835988752] [2023-11-28 20:39:14,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:14,744 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-28 20:39:14,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:14,745 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:14,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:15,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 20:39:15,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:15,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 7 [2023-11-28 20:39:15,049 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-28 20:39:15,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:39:15,562 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-28 20:39:15,582 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:39:15,582 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-28 20:39:15,594 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-28 20:39:15,595 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:15,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:15,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835988752] [2023-11-28 20:39:15,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835988752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:15,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:15,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:39:15,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052626981] [2023-11-28 20:39:15,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:15,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:39:15,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:15,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:39:15,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:39:15,596 INFO L87 Difference]: Start difference. First operand 513 states and 562 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:16,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:16,808 INFO L93 Difference]: Finished difference Result 485 states and 535 transitions. [2023-11-28 20:39:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:39:16,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-28 20:39:16,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:16,811 INFO L225 Difference]: With dead ends: 485 [2023-11-28 20:39:16,811 INFO L226 Difference]: Without dead ends: 485 [2023-11-28 20:39:16,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:39:16,812 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 354 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:16,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 125 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-28 20:39:16,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2023-11-28 20:39:16,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 452. [2023-11-28 20:39:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 270 states have (on average 1.7074074074074075) internal successors, (461), 447 states have internal predecessors, (461), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-28 20:39:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 467 transitions. [2023-11-28 20:39:16,821 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 467 transitions. Word has length 50 [2023-11-28 20:39:16,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:16,821 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 467 transitions. [2023-11-28 20:39:16,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 467 transitions. [2023-11-28 20:39:16,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-28 20:39:16,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:16,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:16,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:17,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:17,023 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:17,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:17,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2047955213, now seen corresponding path program 1 times [2023-11-28 20:39:17,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:17,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901064800] [2023-11-28 20:39:17,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:17,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:39:17,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:17,025 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:17,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:17,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 20:39:17,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:17,215 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-28 20:39:17,230 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-28 20:39:17,254 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-28 20:39:17,265 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-28 20:39:17,265 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:17,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:17,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901064800] [2023-11-28 20:39:17,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901064800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:17,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:17,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:39:17,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214379302] [2023-11-28 20:39:17,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:17,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:39:17,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:17,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:39:17,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:39:17,268 INFO L87 Difference]: Start difference. First operand 452 states and 467 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:19,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:19,064 INFO L93 Difference]: Finished difference Result 451 states and 466 transitions. [2023-11-28 20:39:19,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:39:19,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-28 20:39:19,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:19,069 INFO L225 Difference]: With dead ends: 451 [2023-11-28 20:39:19,069 INFO L226 Difference]: Without dead ends: 451 [2023-11-28 20:39:19,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:39:19,070 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 3 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:19,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 899 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-28 20:39:19,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2023-11-28 20:39:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2023-11-28 20:39:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 270 states have (on average 1.7037037037037037) internal successors, (460), 446 states have internal predecessors, (460), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-28 20:39:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 466 transitions. [2023-11-28 20:39:19,077 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 466 transitions. Word has length 54 [2023-11-28 20:39:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:19,078 INFO L495 AbstractCegarLoop]: Abstraction has 451 states and 466 transitions. [2023-11-28 20:39:19,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 466 transitions. [2023-11-28 20:39:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-28 20:39:19,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:19,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:19,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:19,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:19,279 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:19,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2047955212, now seen corresponding path program 1 times [2023-11-28 20:39:19,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:19,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153480810] [2023-11-28 20:39:19,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:19,280 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-28 20:39:19,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:19,281 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:19,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:19,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-28 20:39:19,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:19,493 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-28 20:39:19,510 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-28 20:39:19,519 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-28 20:39:19,566 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-28 20:39:19,589 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-28 20:39:19,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:19,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:19,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153480810] [2023-11-28 20:39:19,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153480810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:19,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:19,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:39:19,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367607649] [2023-11-28 20:39:19,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:19,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:39:19,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:19,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:39:19,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:39:19,591 INFO L87 Difference]: Start difference. First operand 451 states and 466 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:21,751 INFO L93 Difference]: Finished difference Result 450 states and 465 transitions. [2023-11-28 20:39:21,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:39:21,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-28 20:39:21,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:21,755 INFO L225 Difference]: With dead ends: 450 [2023-11-28 20:39:21,755 INFO L226 Difference]: Without dead ends: 450 [2023-11-28 20:39:21,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:39:21,756 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 1 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:21,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 911 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-28 20:39:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2023-11-28 20:39:21,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2023-11-28 20:39:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 269 states have (on average 1.7063197026022305) internal successors, (459), 445 states have internal predecessors, (459), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-28 20:39:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 465 transitions. [2023-11-28 20:39:21,764 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 465 transitions. Word has length 54 [2023-11-28 20:39:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:21,764 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 465 transitions. [2023-11-28 20:39:21,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 465 transitions. [2023-11-28 20:39:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-28 20:39:21,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:21,766 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-28 20:39:21,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:21,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:21,966 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:21,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:21,967 INFO L85 PathProgramCache]: Analyzing trace with hash 433995383, now seen corresponding path program 1 times [2023-11-28 20:39:21,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:21,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83646635] [2023-11-28 20:39:21,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:21,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-28 20:39:21,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:21,968 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:21,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:22,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:39:22,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:22,222 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-28 20:39:22,222 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:39:22,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83646635] [2023-11-28 20:39:22,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83646635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:39:22,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:39:22,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:39:22,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608938605] [2023-11-28 20:39:22,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:39:22,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:39:22,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:22,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:39:22,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:39:22,225 INFO L87 Difference]: Start difference. First operand 450 states and 465 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 20:39:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:22,875 INFO L93 Difference]: Finished difference Result 452 states and 468 transitions. [2023-11-28 20:39:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:39:22,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2023-11-28 20:39:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:22,882 INFO L225 Difference]: With dead ends: 452 [2023-11-28 20:39:22,882 INFO L226 Difference]: Without dead ends: 452 [2023-11-28 20:39:22,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:39:22,883 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 1 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:22,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1080 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:39:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-11-28 20:39:22,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2023-11-28 20:39:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 270 states have (on average 1.7074074074074075) internal successors, (461), 447 states have internal predecessors, (461), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:39:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 468 transitions. [2023-11-28 20:39:22,894 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 468 transitions. Word has length 60 [2023-11-28 20:39:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:22,894 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 468 transitions. [2023-11-28 20:39:22,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 20:39:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 468 transitions. [2023-11-28 20:39:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-28 20:39:22,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:22,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:22,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:23,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:23,095 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:23,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:23,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1665020324, now seen corresponding path program 1 times [2023-11-28 20:39:23,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:23,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011072060] [2023-11-28 20:39:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:23,096 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-28 20:39:23,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:23,097 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:23,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:23,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:39:23,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:23,337 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-28 20:39:23,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:39:23,403 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-28 20:39:23,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:23,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011072060] [2023-11-28 20:39:23,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011072060] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:39:23,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:39:23,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-28 20:39:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838340405] [2023-11-28 20:39:23,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:39:23,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:39:23,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:23,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:39:23,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:39:23,405 INFO L87 Difference]: Start difference. First operand 452 states and 468 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 20:39:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:24,581 INFO L93 Difference]: Finished difference Result 461 states and 482 transitions. [2023-11-28 20:39:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 20:39:24,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2023-11-28 20:39:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:24,584 INFO L225 Difference]: With dead ends: 461 [2023-11-28 20:39:24,584 INFO L226 Difference]: Without dead ends: 461 [2023-11-28 20:39:24,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-28 20:39:24,585 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 6 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:24,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1793 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-28 20:39:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2023-11-28 20:39:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2023-11-28 20:39:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 277 states have (on average 1.711191335740072) internal successors, (474), 454 states have internal predecessors, (474), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:39:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 481 transitions. [2023-11-28 20:39:24,596 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 481 transitions. Word has length 61 [2023-11-28 20:39:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:24,597 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 481 transitions. [2023-11-28 20:39:24,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 20:39:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 481 transitions. [2023-11-28 20:39:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-28 20:39:24,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:24,598 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:24,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:24,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:24,799 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:24,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:24,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2117439415, now seen corresponding path program 2 times [2023-11-28 20:39:24,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:24,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481088401] [2023-11-28 20:39:24,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:39:24,800 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-28 20:39:24,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:24,801 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:24,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:25,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:39:25,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:39:25,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-28 20:39:25,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:25,235 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-28 20:39:25,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:39:25,389 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-28 20:39:25,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:25,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481088401] [2023-11-28 20:39:25,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481088401] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:39:25,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:39:25,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-28 20:39:25,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072015724] [2023-11-28 20:39:25,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:39:25,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 20:39:25,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:25,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 20:39:25,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-28 20:39:25,392 INFO L87 Difference]: Start difference. First operand 460 states and 481 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 20:39:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:27,098 INFO L93 Difference]: Finished difference Result 475 states and 503 transitions. [2023-11-28 20:39:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-28 20:39:27,098 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2023-11-28 20:39:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:27,101 INFO L225 Difference]: With dead ends: 475 [2023-11-28 20:39:27,101 INFO L226 Difference]: Without dead ends: 473 [2023-11-28 20:39:27,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-28 20:39:27,102 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 13 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:27,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2155 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-28 20:39:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-11-28 20:39:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 469. [2023-11-28 20:39:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 286 states have (on average 1.6993006993006994) internal successors, (486), 463 states have internal predecessors, (486), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:39:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 493 transitions. [2023-11-28 20:39:27,112 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 493 transitions. Word has length 64 [2023-11-28 20:39:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:27,113 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 493 transitions. [2023-11-28 20:39:27,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 20:39:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 493 transitions. [2023-11-28 20:39:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-28 20:39:27,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:27,114 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:27,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-28 20:39:27,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:27,314 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:27,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:27,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1149395561, now seen corresponding path program 3 times [2023-11-28 20:39:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:27,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802546974] [2023-11-28 20:39:27,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 20:39:27,315 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-28 20:39:27,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:27,316 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:27,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:27,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-28 20:39:27,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:39:27,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-28 20:39:27,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:28,017 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-28 20:39:28,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:39:28,669 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-28 20:39:28,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:28,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802546974] [2023-11-28 20:39:28,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802546974] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:39:28,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:39:28,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-28 20:39:28,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470607236] [2023-11-28 20:39:28,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:39:28,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-28 20:39:28,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:28,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-28 20:39:28,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-28 20:39:28,671 INFO L87 Difference]: Start difference. First operand 469 states and 493 transitions. Second operand has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 20:39:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:33,292 INFO L93 Difference]: Finished difference Result 499 states and 543 transitions. [2023-11-28 20:39:33,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-28 20:39:33,293 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2023-11-28 20:39:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:33,295 INFO L225 Difference]: With dead ends: 499 [2023-11-28 20:39:33,295 INFO L226 Difference]: Without dead ends: 496 [2023-11-28 20:39:33,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-28 20:39:33,297 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 25 mSDsluCounter, 3936 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4295 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:33,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4295 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-28 20:39:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-11-28 20:39:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 487. [2023-11-28 20:39:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 304 states have (on average 1.674342105263158) internal successors, (509), 481 states have internal predecessors, (509), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:39:33,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 516 transitions. [2023-11-28 20:39:33,312 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 516 transitions. Word has length 70 [2023-11-28 20:39:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:33,312 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 516 transitions. [2023-11-28 20:39:33,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 20:39:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 516 transitions. [2023-11-28 20:39:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-28 20:39:33,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:33,313 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:33,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-11-28 20:39:33,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:33,514 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:33,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash -931266217, now seen corresponding path program 4 times [2023-11-28 20:39:33,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:33,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475794214] [2023-11-28 20:39:33,516 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 20:39:33,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:39:33,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:33,517 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:33,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:33,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 20:39:33,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:39:33,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-28 20:39:33,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:34,299 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-28 20:39:34,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:39:35,831 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-28 20:39:35,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:35,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475794214] [2023-11-28 20:39:35,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475794214] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:39:35,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:39:35,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-28 20:39:35,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409490888] [2023-11-28 20:39:35,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:39:35,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-28 20:39:35,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:35,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-28 20:39:35,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-28 20:39:35,834 INFO L87 Difference]: Start difference. First operand 487 states and 516 transitions. Second operand has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 20:39:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:47,159 INFO L93 Difference]: Finished difference Result 544 states and 605 transitions. [2023-11-28 20:39:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-28 20:39:47,160 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2023-11-28 20:39:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:47,164 INFO L225 Difference]: With dead ends: 544 [2023-11-28 20:39:47,164 INFO L226 Difference]: Without dead ends: 542 [2023-11-28 20:39:47,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-28 20:39:47,169 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 48 mSDsluCounter, 8257 mSDsCounter, 0 mSdLazyCounter, 3702 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8617 SdHoareTripleChecker+Invalid, 3790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 3702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:47,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 8617 Invalid, 3790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 3702 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2023-11-28 20:39:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2023-11-28 20:39:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 521. [2023-11-28 20:39:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 338 states have (on average 1.6420118343195267) internal successors, (555), 515 states have internal predecessors, (555), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:39:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 562 transitions. [2023-11-28 20:39:47,185 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 562 transitions. Word has length 82 [2023-11-28 20:39:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:47,185 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 562 transitions. [2023-11-28 20:39:47,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 20:39:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 562 transitions. [2023-11-28 20:39:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-28 20:39:47,187 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:47,187 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:39:47,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:47,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:39:47,387 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:39:47,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1486463945, now seen corresponding path program 5 times [2023-11-28 20:39:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:47,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014380635] [2023-11-28 20:39:47,389 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 20:39:47,389 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-28 20:39:47,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:47,389 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:47,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:48,716 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-28 20:39:48,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:39:48,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-28 20:39:48,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:48,769 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-28 20:39:48,769 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-28 20:39:49,120 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-28 20:39:49,120 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-28 20:39:49,179 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-28 20:39:49,396 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-28 20:39:52,065 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:39:52,066 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-28 20:39:52,142 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-28 20:39:52,217 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-28 20:39:52,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:39:52,616 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1647 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_1647) |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-28 20:39:52,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:52,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014380635] [2023-11-28 20:39:52,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014380635] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:39:52,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1176161276] [2023-11-28 20:39:52,619 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 20:39:52,619 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:39:52,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:39:52,621 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:39:52,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-11-28 20:40:57,592 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-28 20:40:57,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:40:57,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-28 20:40:57,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:40:57,837 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 20:40:57,837 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-28 20:40:58,226 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-28 20:40:58,227 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-28 20:40:58,304 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-28 20:40:58,496 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-28 20:40:59,749 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:40:59,749 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-28 20:40:59,855 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-28 20:40:59,917 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-28 20:40:59,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:41:04,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1176161276] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:41:04,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:41:04,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-11-28 20:41:04,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980177699] [2023-11-28 20:41:04,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:41:04,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-28 20:41:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:41:04,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-28 20:41:04,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=4, NotChecked=38, Total=462 [2023-11-28 20:41:04,368 INFO L87 Difference]: Start difference. First operand 521 states and 562 transitions. Second operand has 18 states, 15 states have (on average 8.0) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:41:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:10,863 INFO L93 Difference]: Finished difference Result 958 states and 1035 transitions. [2023-11-28 20:41:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-28 20:41:10,863 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 8.0) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2023-11-28 20:41:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:10,868 INFO L225 Difference]: With dead ends: 958 [2023-11-28 20:41:10,869 INFO L226 Difference]: Without dead ends: 954 [2023-11-28 20:41:10,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=219, Invalid=1113, Unknown=4, NotChecked=70, Total=1406 [2023-11-28 20:41:10,870 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 1998 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1998 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:10,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1998 Valid, 1511 Invalid, 2178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2123 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-11-28 20:41:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2023-11-28 20:41:10,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 520. [2023-11-28 20:41:10,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 338 states have (on average 1.6272189349112427) internal successors, (550), 514 states have internal predecessors, (550), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:41:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 557 transitions. [2023-11-28 20:41:10,883 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 557 transitions. Word has length 104 [2023-11-28 20:41:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:10,883 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 557 transitions. [2023-11-28 20:41:10,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 8.0) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:41:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 557 transitions. [2023-11-28 20:41:10,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-28 20:41:10,885 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:10,885 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:41:10,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2023-11-28 20:41:11,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-28 20:41:11,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:41:11,285 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:41:11,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:11,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1486463944, now seen corresponding path program 1 times [2023-11-28 20:41:11,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:41:11,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719127750] [2023-11-28 20:41:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:11,287 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-28 20:41:11,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:41:11,288 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:41:11,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:41:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:12,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-28 20:41:12,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:41:12,025 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-28 20:41:12,284 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-28 20:41:12,302 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:41:12,303 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-28 20:41:12,327 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-28 20:41:12,332 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-28 20:41:12,441 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-28 20:41:12,446 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-28 20:41:13,163 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:41:13,164 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-28 20:41:13,170 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-28 20:41:13,222 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-28 20:41:13,231 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-28 20:41:13,259 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-28 20:41:13,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:41:14,706 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2627 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2627) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2627 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2627) |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~mem34#1.base| v_ArrVal_2628) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 20:41:14,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:41:14,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719127750] [2023-11-28 20:41:14,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719127750] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:41:14,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [989778869] [2023-11-28 20:41:14,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:14,713 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:41:14,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:41:14,714 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:41:14,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-28 20:42:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:55,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-28 20:42:55,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:42:55,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-28 20:42:55,398 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-28 20:42:55,418 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:42:55,419 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-28 20:42:55,436 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-28 20:42:55,446 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-28 20:42:55,520 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-28 20:42:55,525 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-28 20:42:56,304 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:42:56,304 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-28 20:42:56,314 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-28 20:42:56,370 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-28 20:42:56,379 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-28 20:42:56,381 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-28 20:42:56,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:42:57,799 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3164 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3164) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3164 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3164) |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~mem34#1.base| v_ArrVal_3163) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 20:42:57,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [989778869] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:42:57,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:42:57,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-28 20:42:57,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064573223] [2023-11-28 20:42:57,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:42:57,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:42:57,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:42:57,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:42:57,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-28 20:42:57,806 INFO L87 Difference]: Start difference. First operand 520 states and 557 transitions. Second operand has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 20:43:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:03,343 INFO L93 Difference]: Finished difference Result 529 states and 567 transitions. [2023-11-28 20:43:03,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:43:03,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2023-11-28 20:43:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:03,348 INFO L225 Difference]: With dead ends: 529 [2023-11-28 20:43:03,348 INFO L226 Difference]: Without dead ends: 529 [2023-11-28 20:43:03,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-28 20:43:03,349 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 293 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:03,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 755 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-11-28 20:43:03,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-11-28 20:43:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 519. [2023-11-28 20:43:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 338 states have (on average 1.6242603550295858) internal successors, (549), 513 states have internal predecessors, (549), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:43:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 556 transitions. [2023-11-28 20:43:03,361 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 556 transitions. Word has length 104 [2023-11-28 20:43:03,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:03,361 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 556 transitions. [2023-11-28 20:43:03,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 20:43:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 556 transitions. [2023-11-28 20:43:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-28 20:43:03,363 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:03,363 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:43:03,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:43:03,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-28 20:43:03,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 20:43:03,764 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:43:03,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:03,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1732925383, now seen corresponding path program 1 times [2023-11-28 20:43:03,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:43:03,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429467457] [2023-11-28 20:43:03,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:03,765 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-28 20:43:03,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:43:03,766 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:43:03,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:43:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:04,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-28 20:43:04,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:43:04,629 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-28 20:43:04,773 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:43:04,773 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-28 20:43:04,780 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-28 20:43:04,807 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-28 20:43:04,813 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-28 20:43:04,944 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-28 20:43:04,950 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-28 20:43:05,699 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:43:05,700 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-28 20:43:05,706 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-28 20:43:05,852 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:43:05,853 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-28 20:43:05,860 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-28 20:43:05,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 31 treesize of output 13 [2023-11-28 20:43:05,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 9 treesize of output 3 [2023-11-28 20:43:05,932 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-28 20:43:05,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:43:06,121 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3616 (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_3616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3616) |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_3615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 20:43:06,163 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_3615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_3615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_3616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-28 20:43:07,562 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3708 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3707))) (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~mem34#1.base| v_ArrVal_3708) .cse0 v_ArrVal_3616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_3615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3708 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3708) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3707) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-28 20:43:07,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:43:07,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429467457] [2023-11-28 20:43:07,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429467457] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:43:07,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [602223482] [2023-11-28 20:43:07,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:07,573 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:43:07,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:43:07,574 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:43:07,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-28 20:43:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:10,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-28 20:43:10,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:43:10,986 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-28 20:43:11,324 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-28 20:43:11,341 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:43:11,342 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-28 20:43:11,398 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-28 20:43:11,415 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-28 20:43:11,610 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-28 20:43:11,616 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-28 20:43:12,420 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:43:12,420 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-28 20:43:12,429 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-28 20:43:12,613 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:43:12,614 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-28 20:43:12,621 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-28 20:43:12,635 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-28 20:43:12,639 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-28 20:43:12,646 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-28 20:43:12,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:43:12,703 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4160 (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_4160) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4159 (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_4160) |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~mem36#1.base| v_ArrVal_4159) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 20:43:12,736 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_4160 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4160) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4159) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4160) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-28 20:43:14,087 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4252))) (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~mem34#1.base| v_ArrVal_4251) .cse0 v_ArrVal_4160) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4159) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4160 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4251 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4251) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4160) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-28 20:43:14,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [602223482] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:43:14,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:43:14,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-28 20:43:14,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359348366] [2023-11-28 20:43:14,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:43:14,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-28 20:43:14,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:43:14,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-28 20:43:14,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-28 20:43:14,100 INFO L87 Difference]: Start difference. First operand 519 states and 556 transitions. Second operand has 15 states, 12 states have (on average 9.833333333333334) internal successors, (118), 15 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:43:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:22,653 INFO L93 Difference]: Finished difference Result 528 states and 566 transitions. [2023-11-28 20:43:22,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 20:43:22,655 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.833333333333334) internal successors, (118), 15 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2023-11-28 20:43:22,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:22,657 INFO L225 Difference]: With dead ends: 528 [2023-11-28 20:43:22,657 INFO L226 Difference]: Without dead ends: 528 [2023-11-28 20:43:22,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-28 20:43:22,658 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 631 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 3210 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:22,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1017 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3210 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-11-28 20:43:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-11-28 20:43:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 518. [2023-11-28 20:43:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 338 states have (on average 1.621301775147929) internal successors, (548), 512 states have internal predecessors, (548), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:43:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 555 transitions. [2023-11-28 20:43:22,666 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 555 transitions. Word has length 106 [2023-11-28 20:43:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:22,666 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 555 transitions. [2023-11-28 20:43:22,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.833333333333334) internal successors, (118), 15 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:43:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 555 transitions. [2023-11-28 20:43:22,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-28 20:43:22,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:22,667 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:43:22,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-28 20:43:22,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:43:23,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:43:23,068 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:43:23,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:23,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1732925382, now seen corresponding path program 1 times [2023-11-28 20:43:23,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:43:23,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851867890] [2023-11-28 20:43:23,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:23,069 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-28 20:43:23,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:43:23,070 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:43:23,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:43:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:23,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-28 20:43:23,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:43:23,831 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-28 20:43:23,968 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:43:23,968 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-28 20:43:24,007 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-28 20:43:24,110 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-28 20:43:25,110 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:43:25,110 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-28 20:43:25,227 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:43:25,228 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-28 20:43:25,240 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-28 20:43:25,280 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-28 20:43:25,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:43:25,342 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4658 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4658) |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-28 20:43:25,355 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4658 (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_4658) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-28 20:43:25,729 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4658 (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~mem34#1.base| v_ArrVal_4704))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4658)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:43:25,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:43:25,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851867890] [2023-11-28 20:43:25,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851867890] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:43:25,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [255297691] [2023-11-28 20:43:25,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:25,733 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:43:25,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:43:25,734 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:43:25,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-28 20:43:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:28,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-28 20:43:28,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:43:28,968 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 20:43:28,969 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-28 20:43:29,502 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-28 20:43:29,502 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-28 20:43:29,614 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-28 20:43:29,831 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-28 20:43:31,262 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:43:31,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-28 20:43:31,480 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:43:31,480 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-28 20:43:31,502 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-28 20:43:31,574 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-28 20:43:31,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:43:35,669 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5110 (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_5110) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-11-28 20:43:36,103 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5156 (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~mem34#1.base| v_ArrVal_5156))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5110)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:43:36,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [255297691] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:43:36,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:43:36,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2023-11-28 20:43:36,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952125374] [2023-11-28 20:43:36,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:43:36,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:43:36,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:43:36,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:43:36,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=377, Unknown=7, NotChecked=220, Total=702 [2023-11-28 20:43:36,108 INFO L87 Difference]: Start difference. First operand 518 states and 555 transitions. Second operand has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:43:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:42,807 INFO L93 Difference]: Finished difference Result 948 states and 1021 transitions. [2023-11-28 20:43:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-28 20:43:42,808 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2023-11-28 20:43:42,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:42,813 INFO L225 Difference]: With dead ends: 948 [2023-11-28 20:43:42,813 INFO L226 Difference]: Without dead ends: 948 [2023-11-28 20:43:42,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=127, Invalid=486, Unknown=7, NotChecked=250, Total=870 [2023-11-28 20:43:42,814 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 629 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:42,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1699 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-11-28 20:43:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2023-11-28 20:43:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 517. [2023-11-28 20:43:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 338 states have (on average 1.6183431952662721) internal successors, (547), 511 states have internal predecessors, (547), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:43:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 554 transitions. [2023-11-28 20:43:42,825 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 554 transitions. Word has length 106 [2023-11-28 20:43:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:42,825 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 554 transitions. [2023-11-28 20:43:42,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:43:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 554 transitions. [2023-11-28 20:43:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-28 20:43:42,826 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:42,827 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:43:42,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-28 20:43:43,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:43:43,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:43:43,233 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:43:43,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1105357329, now seen corresponding path program 1 times [2023-11-28 20:43:43,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:43:43,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855404918] [2023-11-28 20:43:43,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:43,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-28 20:43:43,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:43:43,235 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:43:43,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:43:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:44,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-28 20:43:44,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:43:44,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-28 20:43:44,322 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:43:44,322 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-28 20:43:44,362 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-28 20:43:44,463 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-28 20:43:45,395 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:43:45,396 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-28 20:43:45,525 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:43:45,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 43 [2023-11-28 20:43:45,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:43:45,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-28 20:43:45,650 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-28 20:43:45,698 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-28 20:43:45,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:43:45,772 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5578 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_5578) |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-28 20:43:45,785 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5578 (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_5578) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-28 20:43:45,800 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5578 (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~mem36#1.base| v_ArrVal_5577))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5578)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-28 20:43:45,814 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5578 (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_5577))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5578)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:43:46,231 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5578 (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~mem34#1.base| v_ArrVal_5624))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5577)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5578)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 20:43:46,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:43:46,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855404918] [2023-11-28 20:43:46,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855404918] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:43:46,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1635604769] [2023-11-28 20:43:46,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:46,235 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:43:46,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:43:46,236 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:43:46,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-28 20:44:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:00,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-28 20:44:00,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:44:00,852 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 20:44:00,853 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-28 20:44:01,431 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-28 20:44:01,432 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-28 20:44:01,520 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-28 20:44:01,797 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-28 20:44:03,360 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:44:03,360 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-28 20:44:03,594 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:44:03,594 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-28 20:44:03,760 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:44:03,760 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-28 20:44:03,785 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-28 20:44:03,868 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-28 20:44:03,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:44:03,884 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6046 (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_6046) |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-28 20:44:03,896 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6046 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:44:03,911 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6045 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6046 (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_6045))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6046)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:44:03,928 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6045 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6046 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6045))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6046)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:44:04,367 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6045 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6046 (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~mem34#1.base| v_ArrVal_6092))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6045)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6046)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:44:04,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1635604769] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:44:04,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:44:04,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2023-11-28 20:44:04,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69497346] [2023-11-28 20:44:04,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:44:04,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-28 20:44:04,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:44:04,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-28 20:44:04,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=418, Unknown=10, NotChecked=510, Total=1056 [2023-11-28 20:44:04,373 INFO L87 Difference]: Start difference. First operand 517 states and 554 transitions. Second operand has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:44:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:44:10,826 INFO L93 Difference]: Finished difference Result 946 states and 1019 transitions. [2023-11-28 20:44:10,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-28 20:44:10,826 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-28 20:44:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:44:10,832 INFO L225 Difference]: With dead ends: 946 [2023-11-28 20:44:10,832 INFO L226 Difference]: Without dead ends: 946 [2023-11-28 20:44:10,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=148, Invalid=532, Unknown=10, NotChecked=570, Total=1260 [2023-11-28 20:44:10,833 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 900 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:44:10,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1554 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2256 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-11-28 20:44:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2023-11-28 20:44:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 516. [2023-11-28 20:44:10,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 338 states have (on average 1.6153846153846154) internal successors, (546), 510 states have internal predecessors, (546), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:44:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 553 transitions. [2023-11-28 20:44:10,844 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 553 transitions. Word has length 108 [2023-11-28 20:44:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:44:10,845 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 553 transitions. [2023-11-28 20:44:10,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:44:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 553 transitions. [2023-11-28 20:44:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-28 20:44:10,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:44:10,846 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:44:10,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-28 20:44:11,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:44:11,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:44:11,247 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:44:11,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:44:11,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1105357328, now seen corresponding path program 1 times [2023-11-28 20:44:11,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:44:11,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586964579] [2023-11-28 20:44:11,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:11,248 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-28 20:44:11,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:44:11,249 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:44:11,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:44:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:12,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-28 20:44:12,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:44:12,238 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-28 20:44:12,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-28 20:44:12,363 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:44:12,364 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-28 20:44:12,390 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-28 20:44:12,407 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-28 20:44:12,499 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-28 20:44:12,503 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-28 20:44:13,257 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:44:13,257 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-28 20:44:13,263 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-28 20:44:13,411 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:44:13,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-28 20:44:13,418 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-28 20:44:13,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:44:13,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 62 treesize of output 57 [2023-11-28 20:44:13,537 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-28 20:44:13,561 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-28 20:44:13,570 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-28 20:44:13,608 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-28 20:44:13,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:44:13,801 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6561 (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_6561) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (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_6561) |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~mem37#1.base| v_ArrVal_6560) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 20:44:13,838 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_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6561) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6561) |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_6560) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-28 20:44:13,903 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6559))) (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_6558) .cse0 v_ArrVal_6561) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6560) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (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_6558) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6561) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-28 20:44:14,015 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_6558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6558) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6561) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6559))) (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_6558) .cse3 v_ArrVal_6561) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6560) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-28 20:44:17,575 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6652 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6652))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6653) .cse1 v_ArrVal_6558) (select (select (store .cse2 .cse1 v_ArrVal_6559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6561))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6652 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6652))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6559))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6653) .cse4 v_ArrVal_6558) .cse5 v_ArrVal_6561) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6560) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-28 20:44:17,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:44:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586964579] [2023-11-28 20:44:17,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586964579] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:44:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [210664512] [2023-11-28 20:44:17,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:17,594 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:44:17,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:44:17,595 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:44:17,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-28 20:44:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:32,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-28 20:44:32,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:44:32,675 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-28 20:44:33,382 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-28 20:44:33,425 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:44:33,426 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-28 20:44:33,565 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-28 20:44:33,574 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-28 20:44:33,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 18 treesize of output 10 [2023-11-28 20:44:33,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-28 20:44:35,388 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:44:35,389 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-28 20:44:35,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-28 20:44:35,770 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:44:35,771 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-28 20:44:35,788 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-28 20:44:36,035 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:44:36,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-28 20:44:36,052 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-28 20:44:36,086 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-28 20:44:36,094 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-28 20:44:36,110 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-28 20:44:36,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:44:36,197 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7122 (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_7122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7122 (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_7122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-28 20:44:36,250 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_7122 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7122 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7122) |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_7121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-28 20:44:36,306 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7122 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7119) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7122 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7120))) (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~mem36#1.base| v_ArrVal_7119) .cse2 v_ArrVal_7122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-28 20:44:36,387 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_7120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7122 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7119) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7122 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7120))) (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_7119) .cse3 v_ArrVal_7122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-28 20:44:38,353 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7213))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7214) .cse1 v_ArrVal_7119) (select (select (store .cse2 .cse1 v_ArrVal_7120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7122))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7121 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7214 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7213 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7213))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7120))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7214) .cse4 v_ArrVal_7119) .cse5 v_ArrVal_7122) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7121) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-28 20:44:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [210664512] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:44:38,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:44:38,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-28 20:44:38,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930047445] [2023-11-28 20:44:38,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:44:38,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-28 20:44:38,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:44:38,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-28 20:44:38,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-28 20:44:38,368 INFO L87 Difference]: Start difference. First operand 516 states and 553 transitions. Second operand has 17 states, 14 states have (on average 8.714285714285714) internal successors, (122), 17 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:44:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:44:58,562 INFO L93 Difference]: Finished difference Result 525 states and 563 transitions. [2023-11-28 20:44:58,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 20:44:58,564 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.714285714285714) internal successors, (122), 17 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-28 20:44:58,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:44:58,567 INFO L225 Difference]: With dead ends: 525 [2023-11-28 20:44:58,567 INFO L226 Difference]: Without dead ends: 525 [2023-11-28 20:44:58,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-28 20:44:58,568 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 335 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 4182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 4190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 4182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:44:58,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1296 Invalid, 4190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 4182 Invalid, 0 Unknown, 0 Unchecked, 19.6s Time] [2023-11-28 20:44:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-11-28 20:44:58,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 515. [2023-11-28 20:44:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 338 states have (on average 1.6124260355029585) internal successors, (545), 509 states have internal predecessors, (545), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:44:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 552 transitions. [2023-11-28 20:44:58,578 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 552 transitions. Word has length 108 [2023-11-28 20:44:58,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:44:58,579 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 552 transitions. [2023-11-28 20:44:58,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.714285714285714) internal successors, (122), 17 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:44:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 552 transitions. [2023-11-28 20:44:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-28 20:44:58,580 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:44:58,580 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:44:58,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-28 20:44:58,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:44:58,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:44:58,981 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:44:58,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:44:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1390815182, now seen corresponding path program 1 times [2023-11-28 20:44:58,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:44:58,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980732259] [2023-11-28 20:44:58,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:58,982 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-28 20:44:58,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:44:58,983 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:44:58,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:44:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:59,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-28 20:44:59,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:44:59,966 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-28 20:45:00,333 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:45:00,334 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-28 20:45:00,412 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-28 20:45:00,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-28 20:45:02,626 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:45:02,627 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-28 20:45:02,880 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:45:02,880 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-28 20:45:03,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:45:03,088 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-28 20:45:03,304 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:45:03,305 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-28 20:45:03,344 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-28 20:45:03,451 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-28 20:45:03,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:45:03,615 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7652) |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-28 20:45:07,789 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7651 (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~mem37#1.base| v_ArrVal_7651))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7652)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:45:07,819 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7651 (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_7651))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7652)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:45:07,852 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7651 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7650 (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~mem36#1.base| v_ArrVal_7650))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7651)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7652)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 20:45:07,886 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7651 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7650 (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_7650))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7651)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7652)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:45:08,573 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7698 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7651 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7650 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7698))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7650)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7651)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7652)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-28 20:45:08,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:45:08,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980732259] [2023-11-28 20:45:08,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980732259] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:45:08,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [746196270] [2023-11-28 20:45:08,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:45:08,581 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:45:08,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:45:08,582 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:45:08,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-28 20:45:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:27,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-28 20:45:27,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:45:28,089 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 20:45:28,089 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-28 20:45:29,308 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-28 20:45:29,308 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-28 20:45:29,523 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-28 20:45:30,012 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-28 20:45:32,961 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:45:32,961 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-28 20:45:33,429 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:45:33,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-28 20:45:33,777 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:45:33,777 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-28 20:45:34,093 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:45:34,093 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-28 20:45:34,136 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-28 20:45:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-28 20:45:34,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:45:38,553 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8136 (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_8136) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-28 20:45:38,582 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8135 (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~mem37#1.base| v_ArrVal_8135))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8136)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:45:38,610 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8135 (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_8135))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8136)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:45:38,642 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (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~mem36#1.base| v_ArrVal_8134))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8135)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8136)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:45:38,676 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8134))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8135)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8136)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 20:45:39,375 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8134 (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~mem34#1.base| v_ArrVal_8182))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8134)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8135)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8136)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:45:39,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [746196270] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:45:39,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:45:39,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2023-11-28 20:45:39,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969960371] [2023-11-28 20:45:39,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:45:39,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-28 20:45:39,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:45:39,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-28 20:45:39,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=583, Unknown=15, NotChecked=732, Total=1482 [2023-11-28 20:45:39,384 INFO L87 Difference]: Start difference. First operand 515 states and 552 transitions. Second operand has 23 states, 20 states have (on average 6.6) internal successors, (132), 23 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:45:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:45:53,897 INFO L93 Difference]: Finished difference Result 942 states and 1015 transitions. [2023-11-28 20:45:53,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-28 20:45:53,897 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.6) internal successors, (132), 23 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-28 20:45:53,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:45:53,904 INFO L225 Difference]: With dead ends: 942 [2023-11-28 20:45:53,904 INFO L226 Difference]: Without dead ends: 942 [2023-11-28 20:45:53,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=185, Invalid=718, Unknown=15, NotChecked=804, Total=1722 [2023-11-28 20:45:53,905 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 1164 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 2813 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:45:53,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1973 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2813 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2023-11-28 20:45:53,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2023-11-28 20:45:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 514. [2023-11-28 20:45:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 338 states have (on average 1.6094674556213018) internal successors, (544), 508 states have internal predecessors, (544), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:45:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 551 transitions. [2023-11-28 20:45:53,919 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 551 transitions. Word has length 110 [2023-11-28 20:45:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:45:53,919 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 551 transitions. [2023-11-28 20:45:53,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.6) internal successors, (132), 23 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:45:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 551 transitions. [2023-11-28 20:45:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-28 20:45:53,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:45:53,920 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:45:53,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-28 20:45:54,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:45:54,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:45:54,321 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:45:54,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:45:54,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1390815181, now seen corresponding path program 1 times [2023-11-28 20:45:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:45:54,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881891332] [2023-11-28 20:45:54,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:45:54,322 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-28 20:45:54,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:45:54,323 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:45:54,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:45:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:55,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-28 20:45:55,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:45:55,480 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-28 20:45:56,171 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-28 20:45:56,222 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:45:56,223 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-28 20:45:56,284 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-28 20:45:56,299 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-28 20:45:56,562 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-28 20:45:56,571 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-28 20:45:58,140 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:45:58,140 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-28 20:45:58,157 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-28 20:45:58,426 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:45:58,426 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-28 20:45:58,442 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-28 20:45:58,643 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:45:58,643 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-28 20:45:58,660 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-28 20:45:58,880 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:45:58,881 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-28 20:45:58,898 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-28 20:45:58,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-28 20:45:58,943 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-28 20:45:59,024 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-28 20:45:59,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:45:59,349 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8667) |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~mem38#1.base| v_ArrVal_8668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-28 20:45:59,404 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_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8667) |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_8668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-28 20:45:59,500 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8665 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8665))) (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~mem37#1.base| v_ArrVal_8666) .cse0 v_ArrVal_8667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8665 (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_8666) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8665) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-28 20:45:59,702 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_8667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8665 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8666) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8665) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8665 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8665))) (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_8666) .cse3 v_ArrVal_8667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-28 20:46:01,221 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8663 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8664))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8663) .cse1 v_ArrVal_8666) (select (select (store .cse2 .cse1 v_ArrVal_8665) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8667))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8663 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8664))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8665))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8663) .cse4 v_ArrVal_8666) .cse5 v_ArrVal_8667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-28 20:46:01,745 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_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8663 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8664))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8665))) (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_8663) .cse1 v_ArrVal_8666) .cse2 v_ArrVal_8667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8663 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8664))) (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_8663) .cse7 v_ArrVal_8666) (select (select (store .cse8 .cse7 v_ArrVal_8665) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8667))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-28 20:46:08,228 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8760 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8663 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8759))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_8664))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8760) .cse1 v_ArrVal_8663) .cse2 v_ArrVal_8666) (select (select (store .cse3 .cse2 v_ArrVal_8665) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8667))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8760 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8663 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8759))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_8664))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_8665))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8760) .cse6 v_ArrVal_8663) .cse7 v_ArrVal_8666) .cse8 v_ArrVal_8667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_8668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-28 20:46:08,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:46:08,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881891332] [2023-11-28 20:46:08,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881891332] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:46:08,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1644984026] [2023-11-28 20:46:08,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:46:08,273 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:46:08,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:46:08,274 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:46:08,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-28 20:46:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:28,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-28 20:46:28,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:46:28,228 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-28 20:46:30,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-28 20:46:30,830 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:46:30,830 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-28 20:46:30,912 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-28 20:46:30,991 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-28 20:46:31,405 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-28 20:46:31,436 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-28 20:46:36,756 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:46:36,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-28 20:46:36,815 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-28 20:46:37,372 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:46:37,372 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-28 20:46:37,400 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-28 20:46:37,818 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:46:37,818 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-28 20:46:37,871 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-28 20:46:38,241 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:46:38,241 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-28 20:46:38,295 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-28 20:46:38,379 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-28 20:46:38,430 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-28 20:46:38,457 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-28 20:46:38,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:46:38,691 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9245 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9246) |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~mem38#1.base| v_ArrVal_9245) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-28 20:46:38,830 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_9246 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9245 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9246) |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_9245) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-28 20:46:39,107 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9245 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9243))) (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~mem37#1.base| v_ArrVal_9244) .cse0 v_ArrVal_9246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9245) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (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_9244) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-28 20:46:39,321 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_9244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9245 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9243))) (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_9244) .cse1 v_ArrVal_9246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9245) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9244) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-28 20:46:40,445 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9245 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9242))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9243))) (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~mem36#1.base| v_ArrVal_9241) .cse0 v_ArrVal_9244) .cse1 v_ArrVal_9246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9245) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (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_9242))) (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_9241) .cse6 v_ArrVal_9244) (select (select (store .cse7 .cse6 v_ArrVal_9243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9246))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-28 20:46:42,776 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_9244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9245 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9242))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9243))) (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_9241) .cse1 v_ArrVal_9244) .cse2 v_ArrVal_9246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9245) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9242))) (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_9241) .cse7 v_ArrVal_9244) (select (select (store .cse8 .cse7 v_ArrVal_9243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9246))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-28 20:46:51,236 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9245 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9337))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9242))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9243))) (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~mem34#1.base| v_ArrVal_9338) .cse0 v_ArrVal_9241) .cse1 v_ArrVal_9244) .cse2 v_ArrVal_9246) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9245) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9337))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9242))) (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~mem34#1.base| v_ArrVal_9338) .cse8 v_ArrVal_9241) .cse9 v_ArrVal_9244) (select (select (store .cse10 .cse9 v_ArrVal_9243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9246))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-28 20:46:51,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1644984026] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:46:51,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:46:51,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-11-28 20:46:51,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596419924] [2023-11-28 20:46:51,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:46:51,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:46:51,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:46:51,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:46:51,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=160, Unknown=14, NotChecked=518, Total=756 [2023-11-28 20:46:51,283 INFO L87 Difference]: Start difference. First operand 514 states and 551 transitions. Second operand has 12 states, 10 states have (on average 6.6) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 20:47:45,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:45,345 INFO L93 Difference]: Finished difference Result 523 states and 561 transitions. [2023-11-28 20:47:45,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 20:47:45,348 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.6) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2023-11-28 20:47:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:45,351 INFO L225 Difference]: With dead ends: 523 [2023-11-28 20:47:45,351 INFO L226 Difference]: Without dead ends: 523 [2023-11-28 20:47:45,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 209 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=14, NotChecked=714, Total=1190 [2023-11-28 20:47:45,352 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 284 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:45,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1056 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2725 Invalid, 0 Unknown, 0 Unchecked, 51.4s Time] [2023-11-28 20:47:45,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2023-11-28 20:47:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 513. [2023-11-28 20:47:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 338 states have (on average 1.606508875739645) internal successors, (543), 507 states have internal predecessors, (543), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:47:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 550 transitions. [2023-11-28 20:47:45,360 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 550 transitions. Word has length 110 [2023-11-28 20:47:45,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:45,360 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 550 transitions. [2023-11-28 20:47:45,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.6) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 20:47:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 550 transitions. [2023-11-28 20:47:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-28 20:47:45,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:45,361 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:47:45,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-28 20:47:45,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:47:45,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:47:45,762 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:47:45,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:45,762 INFO L85 PathProgramCache]: Analyzing trace with hash -837889959, now seen corresponding path program 1 times [2023-11-28 20:47:45,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:47:45,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950807203] [2023-11-28 20:47:45,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:45,763 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-28 20:47:45,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:47:45,764 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:47:45,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:47:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:47,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-28 20:47:47,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:47:47,151 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-28 20:47:49,218 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:47:49,219 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-28 20:47:49,525 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-28 20:47:50,525 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-28 20:47:59,158 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:47:59,158 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-28 20:48:00,293 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:48:00,293 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-28 20:48:01,257 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:48:01,258 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-28 20:48:02,206 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:48:02,206 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-28 20:48:03,196 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:48:03,196 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-28 20:48:03,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 33 treesize of output 15 [2023-11-28 20:48:03,750 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-28 20:48:03,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2023-11-28 20:48:04,311 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-28 20:48:04,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:48:05,344 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9794 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9794) |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-28 20:48:05,448 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9794 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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_9794) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-28 20:48:05,550 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9793 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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~mem38#1.base| v_ArrVal_9793))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9794)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:48:05,647 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9793 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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_9793))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9794)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:48:05,756 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9792 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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~mem37#1.base| v_ArrVal_9792))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9793)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9794)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:48:05,866 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9792 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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_9792))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9793)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9794)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:48:05,979 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9791 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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~mem36#1.base| v_ArrVal_9791))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9792)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9793)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9794)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:48:06,085 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9791 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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_9791))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9792)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9793)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9794)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:48:08,395 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9793 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9841 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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~mem34#1.base| v_ArrVal_9841))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9791)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9792)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9793)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9794)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 20:48:08,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:48:08,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950807203] [2023-11-28 20:48:08,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950807203] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:48:08,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [958007790] [2023-11-28 20:48:08,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:48:08,420 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:48:08,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:48:08,421 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:48:08,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-28 20:48:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:13,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-28 20:48:13,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:48:14,496 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 20:48:14,496 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-28 20:48:20,884 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-28 20:48:20,885 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-28 20:48:21,796 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-28 20:48:24,136 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-28 20:48:39,752 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:48:39,753 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-28 20:48:42,034 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:48:42,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-28 20:48:43,478 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:48:43,479 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-28 20:48:44,967 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:48:44,968 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-28 20:48:46,374 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:48:46,374 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-28 20:48:46,692 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-28 20:48:47,816 INFO L349 Elim1Store]: treesize reduction 82, result has 29.3 percent of original size [2023-11-28 20:48:47,816 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 35 treesize of output 52 [2023-11-28 20:48:48,735 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-28 20:48:48,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:48:53,006 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10297 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10297) |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-28 20:48:53,094 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10297 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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_10297) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-28 20:48:53,184 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10297 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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~mem38#1.base| v_ArrVal_10296))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:48:53,275 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10297 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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_10296))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:48:53,370 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10297 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10295 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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~mem37#1.base| v_ArrVal_10295))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10296)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:48:53,469 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10297 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10295 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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_10295))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10296)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 20:48:53,571 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10297 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10295 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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~mem36#1.base| v_ArrVal_10294))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10295)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10296)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:48:53,675 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10296 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10297 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10294 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10295 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#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_10294))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10295)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10296)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10297)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:48:56,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [958007790] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:48:56,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:48:56,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 25 [2023-11-28 20:48:56,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725379090] [2023-11-28 20:48:56,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:48:56,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-28 20:48:56,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:48:56,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-28 20:48:56,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=693, Unknown=17, NotChecked=1190, Total=2070 [2023-11-28 20:48:56,847 INFO L87 Difference]: Start difference. First operand 513 states and 550 transitions. Second operand has 26 states, 23 states have (on average 5.913043478260869) internal successors, (136), 25 states have internal predecessors, (136), 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-28 20:50:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:50:05,491 INFO L93 Difference]: Finished difference Result 938 states and 1011 transitions. [2023-11-28 20:50:05,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-28 20:50:05,492 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.913043478260869) internal successors, (136), 25 states have internal predecessors, (136), 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 112 [2023-11-28 20:50:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:50:05,496 INFO L225 Difference]: With dead ends: 938 [2023-11-28 20:50:05,496 INFO L226 Difference]: Without dead ends: 938 [2023-11-28 20:50:05,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 199 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=202, Invalid=841, Unknown=17, NotChecked=1292, Total=2352 [2023-11-28 20:50:05,497 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 610 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 3468 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 3483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:50:05,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 2361 Invalid, 3483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3468 Invalid, 0 Unknown, 0 Unchecked, 67.2s Time] [2023-11-28 20:50:05,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2023-11-28 20:50:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 512. [2023-11-28 20:50:05,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 338 states have (on average 1.6035502958579881) internal successors, (542), 506 states have internal predecessors, (542), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:50:05,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 549 transitions. [2023-11-28 20:50:05,517 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 549 transitions. Word has length 112 [2023-11-28 20:50:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:50:05,518 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 549 transitions. [2023-11-28 20:50:05,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.913043478260869) internal successors, (136), 25 states have internal predecessors, (136), 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-28 20:50:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 549 transitions. [2023-11-28 20:50:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-28 20:50:05,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:50:05,519 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:50:05,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:50:05,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2023-11-28 20:50:05,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 20:50:05,919 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:50:05,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:50:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash -837889958, now seen corresponding path program 1 times [2023-11-28 20:50:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:50:05,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028605712] [2023-11-28 20:50:05,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:50:05,921 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-28 20:50:05,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:50:05,922 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:50:05,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:50:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:50:07,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 123 conjunts are in the unsatisfiable core [2023-11-28 20:50:07,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:50:07,342 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-28 20:50:09,239 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:50:09,239 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-28 20:50:09,369 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-28 20:50:09,652 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-28 20:50:09,820 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-28 20:50:11,017 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-28 20:50:11,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-28 20:50:22,955 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:50:22,955 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-28 20:50:22,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-28 20:50:24,237 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:50:24,238 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-28 20:50:24,274 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-28 20:50:25,275 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:50:25,276 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-28 20:50:25,411 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-28 20:50:26,346 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:50:26,346 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-28 20:50:26,449 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-28 20:50:27,419 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:50:27,420 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-28 20:50:27,456 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-28 20:50:27,710 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-28 20:50:27,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:50:27,765 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-28 20:50:27,801 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-28 20:50:28,120 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-28 20:50:28,120 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-28 20:50:28,449 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-28 20:50:28,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:50:30,117 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10850 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))) (forall ((v_ArrVal_10851 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))) (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))))) is different from false [2023-11-28 20:50:30,324 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~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))) (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10850 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))) (forall ((v_ArrVal_10851 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-28 20:50:30,585 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10848 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))) (forall ((v_ArrVal_10851 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10848))) (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~mem38#1.base| v_ArrVal_10847) .cse0 v_ArrVal_10849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store .cse2 .cse0 v_ArrVal_10850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) (or (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10848 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10847) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd .cse3 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))))) is different from false [2023-11-28 20:50:32,954 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_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10848 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_10851 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10848))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_10847) .cse1 v_ArrVal_10849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store .cse3 .cse1 v_ArrVal_10850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))) (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10848 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_10847) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))))))) is different from false [2023-11-28 20:50:33,192 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10848 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32)) (v_ArrVal_10845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10846 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10851 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10845))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10848))) (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~mem37#1.base| v_ArrVal_10846) .cse0 v_ArrVal_10847) .cse1 v_ArrVal_10849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store .cse3 .cse1 v_ArrVal_10850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))) (or (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10846 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10845))) (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~mem37#1.base| v_ArrVal_10846) .cse6 v_ArrVal_10847) (select (select (store .cse7 .cse6 v_ArrVal_10848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10849))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv4 32) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))))) is different from false [2023-11-28 20:50:33,418 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_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10848 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32)) (v_ArrVal_10845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10846 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))) (forall ((v_ArrVal_10851 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10845))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10848))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_10846) .cse1 v_ArrVal_10847) .cse2 v_ArrVal_10849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store .cse4 .cse2 v_ArrVal_10850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (or (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10846 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10845))) (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_10846) .cse7 v_ArrVal_10847) (select (select (store .cse8 .cse7 v_ArrVal_10848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10849))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse6 (bvadd (_ bv4 32) .cse6)))) (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))))))) is different from false [2023-11-28 20:50:33,755 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10848 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32)) (v_ArrVal_10845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10846 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))) (forall ((v_ArrVal_10851 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10843))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10845))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10848))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10844) .cse0 v_ArrVal_10846) .cse1 v_ArrVal_10847) .cse2 v_ArrVal_10849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store .cse4 .cse2 v_ArrVal_10850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))) (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10846 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10843))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10845))) (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~mem36#1.base| v_ArrVal_10844) .cse8 v_ArrVal_10846) .cse9 v_ArrVal_10847) (select (select (store .cse10 .cse9 v_ArrVal_10848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10849))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd (_ bv4 32) .cse7))))))) is different from false [2023-11-28 20:50:34,143 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (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|) .cse5))) (and (or (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10846 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10843))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_10845))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10844) .cse2 v_ArrVal_10846) .cse3 v_ArrVal_10847) (select (select (store .cse4 .cse3 v_ArrVal_10848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_10849))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))) (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10848 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32)) (v_ArrVal_10845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10846 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))) (forall ((v_ArrVal_10851 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10843))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_10845))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10848))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10844) .cse7 v_ArrVal_10846) .cse8 v_ArrVal_10847) .cse9 v_ArrVal_10849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store .cse10 .cse9 v_ArrVal_10850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))) is different from false [2023-11-28 20:50:39,039 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~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))) (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10942 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10846 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10943))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_10843))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_10845))) (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~mem34#1.base| v_ArrVal_10942) .cse1 v_ArrVal_10844) .cse2 v_ArrVal_10846) .cse3 v_ArrVal_10847) (select (select (store .cse4 .cse3 v_ArrVal_10848) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_10849))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_10849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10942 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10848 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32)) (v_ArrVal_10845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10846 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))) (forall ((v_ArrVal_10851 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_10943))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_10843))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_10845))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_10848))) (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~mem34#1.base| v_ArrVal_10942) .cse8 v_ArrVal_10844) .cse9 v_ArrVal_10846) .cse10 v_ArrVal_10847) .cse11 v_ArrVal_10849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store .cse12 .cse11 v_ArrVal_10850) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))))) is different from false [2023-11-28 20:50:39,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:50:39,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028605712] [2023-11-28 20:50:39,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028605712] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:50:39,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [311086425] [2023-11-28 20:50:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:50:39,068 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:50:39,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:50:39,080 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:50:39,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-28 20:50:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:50:44,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 125 conjunts are in the unsatisfiable core [2023-11-28 20:50:44,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:50:44,962 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-28 20:50:48,713 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:50:48,713 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-28 20:50:48,877 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-28 20:50:49,540 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-28 20:50:49,607 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-28 20:50:51,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2023-11-28 20:50:51,722 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-28 20:51:02,942 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:51:02,943 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 61 treesize of output 54 [2023-11-28 20:51:03,012 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-28 20:51:05,084 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:51:05,084 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 61 treesize of output 54 [2023-11-28 20:51:05,153 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-28 20:51:06,482 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:51:06,482 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 61 treesize of output 54 [2023-11-28 20:51:06,552 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-28 20:51:07,859 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:51:07,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-11-28 20:51:07,896 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-28 20:51:09,252 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:51:09,252 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 61 treesize of output 54 [2023-11-28 20:51:09,289 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-28 20:51:09,476 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 36 treesize of output 20 [2023-11-28 20:51:09,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:51:09,530 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-28 20:51:09,566 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-28 20:51:09,888 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-28 20:51:09,889 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-28 20:51:09,957 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-28 20:51:09,957 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:51:11,282 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_10851 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))) (forall ((v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))))) is different from false [2023-11-28 20:51:11,486 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_11448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_10851 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))) (forall ((v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))))))) is different from false [2023-11-28 20:51:11,709 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))) (forall ((v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11447) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_11448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11447 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))) (forall ((v_ArrVal_10851 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11446))) (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~mem38#1.base| v_ArrVal_11447) .cse2 v_ArrVal_11449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store .cse3 .cse2 v_ArrVal_11448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))))) is different from false [2023-11-28 20:51:11,940 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~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))) (forall ((v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_11447) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_11448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11447 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_10851 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11446))) (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_11447) .cse3 v_ArrVal_11449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store .cse4 .cse3 v_ArrVal_11448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))))))) is different from false [2023-11-28 20:51:12,166 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))) (forall ((v_ArrVal_11444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11444))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11445) .cse1 v_ArrVal_11447) (select (select (store .cse2 .cse1 v_ArrVal_11446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11449))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_11444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11447 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_10851 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11444))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_11446))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_11445) .cse4 v_ArrVal_11447) .cse5 v_ArrVal_11449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store .cse6 .cse5 v_ArrVal_11448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))))) is different from false [2023-11-28 20:51:19,489 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_11444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11442))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_11444))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11443) .cse1 v_ArrVal_11445) .cse2 v_ArrVal_11447) (select (select (store .cse3 .cse2 v_ArrVal_11446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11449))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))) (forall ((v_ArrVal_11444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11447 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_10851 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11442))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_11444))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_11446))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11443) .cse6 v_ArrVal_11445) .cse7 v_ArrVal_11447) .cse8 v_ArrVal_11449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store .cse9 .cse8 v_ArrVal_11448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))))) is different from false [2023-11-28 20:51:20,272 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_11444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11447 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_10851 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11442))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_11444))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_11446))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11443) .cse1 v_ArrVal_11445) .cse2 v_ArrVal_11447) .cse3 v_ArrVal_11449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store .cse5 .cse3 v_ArrVal_11448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))) (or (forall ((v_ArrVal_11444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11442))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_11444))) (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_11443) .cse9 v_ArrVal_11445) .cse10 v_ArrVal_11447) (select (select (store .cse11 .cse10 v_ArrVal_11446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11449))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse8 (bvadd (_ bv4 32) .cse8)))) (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))))))) is different from false [2023-11-28 20:51:25,289 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~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))) (forall ((v_ArrVal_11444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11542))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_11442))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_11444))) (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~mem34#1.base| v_ArrVal_11541) .cse1 v_ArrVal_11443) .cse2 v_ArrVal_11445) .cse3 v_ArrVal_11447) (select (select (store .cse4 .cse3 v_ArrVal_11446) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11449))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_11444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11445 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11449 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11447 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_10851 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_11542))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_11442))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_11444))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_11446))) (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~mem34#1.base| v_ArrVal_11541) .cse8 v_ArrVal_11443) .cse9 v_ArrVal_11445) .cse10 v_ArrVal_11447) .cse11 v_ArrVal_11449) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10851) (select (select (store .cse12 .cse11 v_ArrVal_11448) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))))) is different from false [2023-11-28 20:51:25,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [311086425] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:51:25,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:51:25,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2023-11-28 20:51:25,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386180038] [2023-11-28 20:51:25,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:51:25,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-28 20:51:25,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:51:25,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-28 20:51:25,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=448, Unknown=23, NotChecked=1020, Total=1640 [2023-11-28 20:51:25,348 INFO L87 Difference]: Start difference. First operand 512 states and 549 transitions. Second operand has 21 states, 18 states have (on average 7.222222222222222) internal successors, (130), 21 states have internal predecessors, (130), 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-28 20:52:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:52:23,762 INFO L93 Difference]: Finished difference Result 521 states and 559 transitions. [2023-11-28 20:52:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-28 20:52:23,764 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.222222222222222) internal successors, (130), 21 states have internal predecessors, (130), 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 112 [2023-11-28 20:52:23,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:52:23,767 INFO L225 Difference]: With dead ends: 521 [2023-11-28 20:52:23,767 INFO L226 Difference]: Without dead ends: 521 [2023-11-28 20:52:23,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 203 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=159, Invalid=486, Unknown=23, NotChecked=1054, Total=1722 [2023-11-28 20:52:23,768 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 580 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 3208 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 3219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:52:23,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 981 Invalid, 3219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3208 Invalid, 0 Unknown, 0 Unchecked, 57.9s Time] [2023-11-28 20:52:23,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2023-11-28 20:52:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 511. [2023-11-28 20:52:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 338 states have (on average 1.6005917159763314) internal successors, (541), 505 states have internal predecessors, (541), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-28 20:52:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 548 transitions. [2023-11-28 20:52:23,775 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 548 transitions. Word has length 112 [2023-11-28 20:52:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:52:23,775 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 548 transitions. [2023-11-28 20:52:23,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.222222222222222) internal successors, (130), 21 states have internal predecessors, (130), 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-28 20:52:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 548 transitions. [2023-11-28 20:52:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-28 20:52:23,776 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:52:23,776 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:52:23,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-28 20:52:23,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2023-11-28 20:52:24,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.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-28 20:52:24,177 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 327 more)] === [2023-11-28 20:52:24,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:52:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2052721424, now seen corresponding path program 1 times [2023-11-28 20:52:24,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:52:24,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045572911] [2023-11-28 20:52:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:52:24,178 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-28 20:52:24,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:52:24,179 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:52:24,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-11-28 20:52:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:52:25,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-28 20:52:25,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:52:25,864 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-28 20:52:27,605 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:52:27,605 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-28 20:52:27,806 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-28 20:52:31,126 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:52:31,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-11-28 20:52:31,740 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:52:31,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-11-28 20:52:32,334 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:52:32,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-11-28 20:52:32,961 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:52:32,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-11-28 20:52:33,638 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:52:33,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-11-28 20:52:34,350 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:52:34,350 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-28 20:52:34,912 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-28 20:52:35,278 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-28 20:52:35,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:52:35,856 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-11-28 20:52:35,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-11-28 20:52:36,740 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-11-28 20:52:36,828 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12003)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_12004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-11-28 20:52:36,916 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12003))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_12004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-11-28 20:52:37,009 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12002))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12003)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_12004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-11-28 20:52:37,102 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12002))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12003)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_12004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-11-28 20:52:37,201 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_12001))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12002)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12003)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_12004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-11-28 20:52:37,299 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12001))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12002)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12003)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_12004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-11-28 20:52:37,407 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_12000))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12001)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12002)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12003)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_12004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-11-28 20:52:37,520 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12004 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12000))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12001)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12002)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12003)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_12004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-11-28 20:52:39,723 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12001 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12050 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_12050))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12000)))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12001)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12002)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12003)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_12004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-11-28 20:52:39,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:52:39,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045572911] [2023-11-28 20:52:39,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045572911] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:52:39,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2128360907] [2023-11-28 20:52:39,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:52:39,745 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:52:39,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:52:39,746 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:52:39,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd9ba93e-ab9a-4ca2-b84e-df8284131d27/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-28 20:52:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:52:44,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-28 20:52:44,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:52:45,597 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 20:52:45,597 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-28 20:52:51,366 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-28 20:52:51,366 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-28 20:52:52,314 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-28 20:52:54,498 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-28 20:53:08,978 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:53:08,979 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-28 20:53:11,083 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:53:11,084 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-28 20:53:12,505 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:53:12,505 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-28 20:53:13,963 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:53:13,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 44 treesize of output 41 [2023-11-28 20:53:15,331 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:53:15,332 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-28 20:53:16,570 INFO L349 Elim1Store]: treesize reduction 94, result has 30.9 percent of original size [2023-11-28 20:53:16,571 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-28 20:53:17,743 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:53:17,743 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-28 20:53:17,987 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-28 20:53:18,891 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-28 20:53:18,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:53:19,058 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12514 (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~mem40#1.base| v_ArrVal_12514) |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-28 20:53:19,213 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12513 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc41#1.base_21| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21| v_ArrVal_12513) (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_12514) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-28 20:53:19,348 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12513 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc41#1.base_21| (_ BitVec 32)) (v_ArrVal_12512 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21| v_ArrVal_12513) (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~mem39#1.base| v_ArrVal_12512))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12514)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-28 20:53:19,475 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12513 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc41#1.base_21| (_ BitVec 32)) (v_ArrVal_12512 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21| v_ArrVal_12513) (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_12512))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12514)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-28 20:53:19,605 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12513 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc41#1.base_21| (_ BitVec 32)) (v_ArrVal_12512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12511 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21|) (_ bv0 1))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21| v_ArrVal_12513) (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~mem38#1.base| v_ArrVal_12511))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12512)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12514)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1)))) is different from false [2023-11-28 20:53:19,737 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12513 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc41#1.base_21| (_ BitVec 32)) (v_ArrVal_12512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12511 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21| v_ArrVal_12513) (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_12511))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12512)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12514)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-28 20:53:19,872 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12513 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc41#1.base_21| (_ BitVec 32)) (v_ArrVal_12510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12511 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21| v_ArrVal_12513) (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~mem37#1.base| v_ArrVal_12510))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12511)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12512)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12514)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-28 20:53:20,010 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12513 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc41#1.base_21| (_ BitVec 32)) (v_ArrVal_12510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12511 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21| v_ArrVal_12513) (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_12510))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12511)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12512)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12514)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-28 20:53:20,153 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12513 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc41#1.base_21| (_ BitVec 32)) (v_ArrVal_12510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12511 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21| v_ArrVal_12513) (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~mem36#1.base| v_ArrVal_12509))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12510)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12511)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12512)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12514)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-28 20:53:20,302 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12514 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12513 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc41#1.base_21| (_ BitVec 32)) (v_ArrVal_12510 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12512 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12511 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_21| v_ArrVal_12513) (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12509))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12510)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12511)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12512)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12514)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-28 20:53:23,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2128360907] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:53:23,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:53:23,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2023-11-28 20:53:23,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020898519] [2023-11-28 20:53:23,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:53:23,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-28 20:53:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:53:23,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-28 20:53:23,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=856, Unknown=30, NotChecked=1580, Total=2652 [2023-11-28 20:53:23,463 INFO L87 Difference]: Start difference. First operand 511 states and 548 transitions. Second operand has 29 states, 26 states have (on average 5.384615384615385) internal successors, (140), 28 states have internal predecessors, (140), 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)