./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-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_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/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_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/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_04472647-e8e4-4085-8059-94493721a3fa/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 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:35:58,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:35:58,172 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-28 20:35:58,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:35:58,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:35:58,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:35:58,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:35:58,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:35:58,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:35:58,207 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:35:58,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:35:58,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:35:58,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:35:58,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:35:58,210 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:35:58,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:35:58,212 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:35:58,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:35:58,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:35:58,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:35:58,214 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 20:35:58,215 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 20:35:58,215 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 20:35:58,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:35:58,216 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:35:58,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:35:58,217 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:35:58,217 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:35:58,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:35:58,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:35:58,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:35:58,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:35:58,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:35:58,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:35:58,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:35:58,220 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:35:58,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:35:58,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:35:58,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:35:58,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:35:58,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:35:58,222 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_04472647-e8e4-4085-8059-94493721a3fa/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_04472647-e8e4-4085-8059-94493721a3fa/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 -> 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 [2023-11-28 20:35:58,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:35:58,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:35:58,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:35:58,486 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:35:58,486 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:35:58,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2023-11-28 20:36:01,277 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:36:01,562 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:36:01,562 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2023-11-28 20:36:01,580 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/data/eaaefe076/fb71816eeed44adfa96d75185ef1ea9d/FLAGcac1414d9 [2023-11-28 20:36:01,594 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/data/eaaefe076/fb71816eeed44adfa96d75185ef1ea9d [2023-11-28 20:36:01,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:36:01,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:36:01,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:01,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:36:01,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:36:01,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6975c998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:01, skipping insertion in model container [2023-11-28 20:36:01,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:01" (1/1) ... [2023-11-28 20:36:01,669 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:36:02,161 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:02,173 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:36:02,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@600772ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:02, skipping insertion in model container [2023-11-28 20:36:02,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:02,175 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-28 20:36:02,177 INFO L158 Benchmark]: Toolchain (without parser) took 578.14ms. Allocated memory is still 144.7MB. Free memory was 111.8MB in the beginning and 92.6MB in the end (delta: 19.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-28 20:36:02,178 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 144.7MB. Free memory was 104.0MB in the beginning and 103.9MB in the end (delta: 147.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:36:02,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.89ms. Allocated memory is still 144.7MB. Free memory was 111.8MB in the beginning and 92.6MB in the end (delta: 19.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-28 20:36:02,180 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.22ms. Allocated memory is still 144.7MB. Free memory was 104.0MB in the beginning and 103.9MB in the end (delta: 147.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 575.89ms. Allocated memory is still 144.7MB. Free memory was 111.8MB in the beginning and 92.6MB in the end (delta: 19.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 815]: 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_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/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_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/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_04472647-e8e4-4085-8059-94493721a3fa/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 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:36:03,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:36:04,015 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-28 20:36:04,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:36:04,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:36:04,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:36:04,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:36:04,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:36:04,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:36:04,059 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:36:04,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:36:04,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:36:04,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:36:04,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:36:04,062 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:36:04,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:36:04,063 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:36:04,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:36:04,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:36:04,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:36:04,065 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 20:36:04,066 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 20:36:04,066 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 20:36:04,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:36:04,067 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:36:04,068 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:36:04,068 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:36:04,069 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:36:04,069 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:36:04,069 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:36:04,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:36:04,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:36:04,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:36:04,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:36:04,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:36:04,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:36:04,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:36:04,072 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:36:04,072 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:36:04,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:36:04,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:36:04,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:36:04,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:36:04,073 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:36:04,073 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_04472647-e8e4-4085-8059-94493721a3fa/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_04472647-e8e4-4085-8059-94493721a3fa/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 -> 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 [2023-11-28 20:36:04,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:36:04,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:36:04,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:36:04,389 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:36:04,390 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:36:04,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2023-11-28 20:36:07,240 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:36:07,544 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:36:07,545 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2023-11-28 20:36:07,562 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/data/8ed44f549/82132624046142d2a0e346ef25df089c/FLAGa92d6c352 [2023-11-28 20:36:07,574 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/data/8ed44f549/82132624046142d2a0e346ef25df089c [2023-11-28 20:36:07,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:36:07,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:36:07,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:07,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:36:07,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:36:07,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:07" (1/1) ... [2023-11-28 20:36:07,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42bda515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:07, skipping insertion in model container [2023-11-28 20:36:07,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:07" (1/1) ... [2023-11-28 20:36:07,646 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:36:08,082 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:08,095 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-28 20:36:08,109 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:36:08,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:08,181 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:36:08,247 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:08,290 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:08,298 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:36:08,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:08 WrapperNode [2023-11-28 20:36:08,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:08,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:36:08,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:36:08,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:36:08,307 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:36:08" (1/1) ... [2023-11-28 20:36:08,346 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:36:08" (1/1) ... [2023-11-28 20:36:08,398 INFO L138 Inliner]: procedures = 211, calls = 237, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 893 [2023-11-28 20:36:08,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:36:08,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:36:08,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:36:08,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:36:08,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:08" (1/1) ... [2023-11-28 20:36:08,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:08" (1/1) ... [2023-11-28 20:36:08,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:08" (1/1) ... [2023-11-28 20:36:08,480 INFO L175 MemorySlicer]: Split 213 memory accesses to 4 slices as follows [2, 34, 5, 172]. 81 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 47 writes are split as follows [0, 4, 1, 42]. [2023-11-28 20:36:08,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:08" (1/1) ... [2023-11-28 20:36:08,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:08" (1/1) ... [2023-11-28 20:36:08,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:08" (1/1) ... [2023-11-28 20:36:08,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:08" (1/1) ... [2023-11-28 20:36:08,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:08" (1/1) ... [2023-11-28 20:36:08,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:08" (1/1) ... [2023-11-28 20:36:08,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:36:08,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:36:08,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:36:08,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:36:08,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:08" (1/1) ... [2023-11-28 20:36:08,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:36:08,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:36:08,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/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:36:08,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/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:36:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-28 20:36:08,615 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-28 20:36:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-28 20:36:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-28 20:36:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-28 20:36:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-28 20:36:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-28 20:36:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-28 20:36:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-28 20:36:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-28 20:36:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-28 20:36:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-28 20:36:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-28 20:36:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-28 20:36:08,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-28 20:36:08,617 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-28 20:36:08,617 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-28 20:36:08,617 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-28 20:36:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:36:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-28 20:36:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-28 20:36:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-28 20:36:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-28 20:36:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-28 20:36:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:36:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-28 20:36:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-28 20:36:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-28 20:36:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-28 20:36:08,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:36:08,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-28 20:36:08,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-28 20:36:08,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-28 20:36:08,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-28 20:36:08,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-28 20:36:08,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-28 20:36:08,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:36:08,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-28 20:36:08,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-28 20:36:08,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-28 20:36:08,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-28 20:36:08,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:36:08,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:36:08,818 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:36:08,821 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:36:08,849 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 20:36:08,881 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 20:36:08,903 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 20:36:08,927 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 20:36:12,442 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:36:12,583 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:36:12,583 INFO L309 CfgBuilder]: Removed 54 assume(true) statements. [2023-11-28 20:36:12,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:12 BoogieIcfgContainer [2023-11-28 20:36:12,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:36:12,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:36:12,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:36:12,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:36:12,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:36:07" (1/3) ... [2023-11-28 20:36:12,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e0ff49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:36:12, skipping insertion in model container [2023-11-28 20:36:12,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:08" (2/3) ... [2023-11-28 20:36:12,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e0ff49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:36:12, skipping insertion in model container [2023-11-28 20:36:12,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:12" (3/3) ... [2023-11-28 20:36:12,592 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test2-1.i [2023-11-28 20:36:12,606 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:36:12,606 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 430 error locations. [2023-11-28 20:36:12,658 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:36:12,663 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;@59089e49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:36:12,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 430 error locations. [2023-11-28 20:36:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 801 states, 360 states have (on average 2.4944444444444445) internal successors, (898), 794 states have internal predecessors, (898), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-28 20:36:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-28 20:36:12,674 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:12,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-28 20:36:12,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:12,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:12,679 INFO L85 PathProgramCache]: Analyzing trace with hash 47665, now seen corresponding path program 1 times [2023-11-28 20:36:12,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:12,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827739514] [2023-11-28 20:36:12,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:12,689 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:36:12,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:12,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:12,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:12,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:36:12,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:12,928 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:36:12,940 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:36:12,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:12,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:12,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827739514] [2023-11-28 20:36:12,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827739514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:12,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:12,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:36:12,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049793193] [2023-11-28 20:36:12,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:12,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:36:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:12,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:36:12,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:36:12,979 INFO L87 Difference]: Start difference. First operand has 801 states, 360 states have (on average 2.4944444444444445) internal successors, (898), 794 states have internal predecessors, (898), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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:36:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:14,391 INFO L93 Difference]: Finished difference Result 789 states and 845 transitions. [2023-11-28 20:36:14,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:36:14,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-28 20:36:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:14,411 INFO L225 Difference]: With dead ends: 789 [2023-11-28 20:36:14,411 INFO L226 Difference]: Without dead ends: 788 [2023-11-28 20:36:14,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:36:14,416 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 729 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:14,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 483 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-28 20:36:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2023-11-28 20:36:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 787. [2023-11-28 20:36:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 363 states have (on average 2.275482093663912) internal successors, (826), 780 states have internal predecessors, (826), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-28 20:36:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 844 transitions. [2023-11-28 20:36:14,488 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 844 transitions. Word has length 2 [2023-11-28 20:36:14,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:14,489 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 844 transitions. [2023-11-28 20:36:14,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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:36:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 844 transitions. [2023-11-28 20:36:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-28 20:36:14,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:14,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-28 20:36:14,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:14,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:14,692 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:14,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash 47666, now seen corresponding path program 1 times [2023-11-28 20:36:14,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:14,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092881247] [2023-11-28 20:36:14,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:14,694 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:36:14,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:14,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:14,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:14,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:36:14,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:14,793 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:36:14,805 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:36:14,805 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:14,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:14,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092881247] [2023-11-28 20:36:14,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092881247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:14,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:14,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:36:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556827566] [2023-11-28 20:36:14,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:14,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:36:14,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:14,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:36:14,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:36:14,809 INFO L87 Difference]: Start difference. First operand 787 states and 844 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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:36:17,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:17,059 INFO L93 Difference]: Finished difference Result 985 states and 1074 transitions. [2023-11-28 20:36:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:36:17,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-28 20:36:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:17,065 INFO L225 Difference]: With dead ends: 985 [2023-11-28 20:36:17,065 INFO L226 Difference]: Without dead ends: 985 [2023-11-28 20:36:17,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:36:17,067 INFO L413 NwaCegarLoop]: 678 mSDtfsCounter, 219 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:17,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1080 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-28 20:36:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2023-11-28 20:36:17,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 899. [2023-11-28 20:36:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 471 states have (on average 2.21656050955414) internal successors, (1044), 892 states have internal predecessors, (1044), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-28 20:36:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1072 transitions. [2023-11-28 20:36:17,095 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1072 transitions. Word has length 2 [2023-11-28 20:36:17,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:17,095 INFO L495 AbstractCegarLoop]: Abstraction has 899 states and 1072 transitions. [2023-11-28 20:36:17,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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:36:17,095 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1072 transitions. [2023-11-28 20:36:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-28 20:36:17,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:17,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-28 20:36:17,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:17,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:17,296 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:17,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1070701435, now seen corresponding path program 1 times [2023-11-28 20:36:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:17,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635854092] [2023-11-28 20:36:17,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:17,298 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:36:17,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:17,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:17,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:17,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 20:36:17,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:17,432 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:36:17,462 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:36:17,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:36:17,528 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:36:17,556 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:36:17,557 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:36:17,576 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:36:17,576 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:17,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:17,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635854092] [2023-11-28 20:36:17,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635854092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:17,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:17,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:36:17,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749424477] [2023-11-28 20:36:17,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:17,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:17,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:17,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:17,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:17,579 INFO L87 Difference]: Start difference. First operand 899 states and 1072 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:36:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:19,711 INFO L93 Difference]: Finished difference Result 889 states and 1061 transitions. [2023-11-28 20:36:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:19,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-28 20:36:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:19,716 INFO L225 Difference]: With dead ends: 889 [2023-11-28 20:36:19,716 INFO L226 Difference]: Without dead ends: 889 [2023-11-28 20:36:19,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:36:19,718 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 794 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:19,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 257 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-28 20:36:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2023-11-28 20:36:19,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 776. [2023-11-28 20:36:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 363 states have (on average 2.242424242424242) internal successors, (814), 769 states have internal predecessors, (814), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-28 20:36:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 832 transitions. [2023-11-28 20:36:19,737 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 832 transitions. Word has length 6 [2023-11-28 20:36:19,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:19,738 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 832 transitions. [2023-11-28 20:36:19,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:36:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 832 transitions. [2023-11-28 20:36:19,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-28 20:36:19,739 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:19,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:19,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:19,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:19,941 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:19,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:19,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1167993873, now seen corresponding path program 1 times [2023-11-28 20:36:19,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:19,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449887181] [2023-11-28 20:36:19,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:19,942 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:36:19,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:19,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:19,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:20,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:36:20,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:20,048 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:36:20,061 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:36:20,061 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:20,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:20,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449887181] [2023-11-28 20:36:20,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449887181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:20,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:20,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:36:20,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99034535] [2023-11-28 20:36:20,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:20,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:36:20,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:20,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:36:20,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:36:20,064 INFO L87 Difference]: Start difference. First operand 776 states and 832 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:36:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:21,842 INFO L93 Difference]: Finished difference Result 929 states and 1017 transitions. [2023-11-28 20:36:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:36:21,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-28 20:36:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:21,850 INFO L225 Difference]: With dead ends: 929 [2023-11-28 20:36:21,850 INFO L226 Difference]: Without dead ends: 929 [2023-11-28 20:36:21,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:36:21,851 INFO L413 NwaCegarLoop]: 567 mSDtfsCounter, 732 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:21,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 722 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-28 20:36:21,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2023-11-28 20:36:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 729. [2023-11-28 20:36:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 363 states have (on average 2.112947658402204) internal successors, (767), 722 states have internal predecessors, (767), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-28 20:36:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 785 transitions. [2023-11-28 20:36:21,876 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 785 transitions. Word has length 7 [2023-11-28 20:36:21,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:21,876 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 785 transitions. [2023-11-28 20:36:21,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:36:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 785 transitions. [2023-11-28 20:36:21,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-28 20:36:21,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:21,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:21,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:22,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:22,081 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:22,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:22,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1167993872, now seen corresponding path program 1 times [2023-11-28 20:36:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:22,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818012078] [2023-11-28 20:36:22,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:22,082 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:36:22,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:22,083 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:22,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:22,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:36:22,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:22,198 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:36:22,220 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:36:22,220 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:22,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:22,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818012078] [2023-11-28 20:36:22,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [818012078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:22,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:22,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:36:22,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297646193] [2023-11-28 20:36:22,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:22,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:36:22,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:22,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:36:22,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:36:22,222 INFO L87 Difference]: Start difference. First operand 729 states and 785 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:36:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:24,455 INFO L93 Difference]: Finished difference Result 989 states and 1079 transitions. [2023-11-28 20:36:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:36:24,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-28 20:36:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:24,462 INFO L225 Difference]: With dead ends: 989 [2023-11-28 20:36:24,462 INFO L226 Difference]: Without dead ends: 989 [2023-11-28 20:36:24,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:36:24,464 INFO L413 NwaCegarLoop]: 727 mSDtfsCounter, 452 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:24,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1005 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-28 20:36:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2023-11-28 20:36:24,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 742. [2023-11-28 20:36:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 386 states have (on average 2.1088082901554404) internal successors, (814), 735 states have internal predecessors, (814), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-28 20:36:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 832 transitions. [2023-11-28 20:36:24,486 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 832 transitions. Word has length 7 [2023-11-28 20:36:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:24,486 INFO L495 AbstractCegarLoop]: Abstraction has 742 states and 832 transitions. [2023-11-28 20:36:24,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:36:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 832 transitions. [2023-11-28 20:36:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-28 20:36:24,487 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:24,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:24,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:24,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:24,689 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr428ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:24,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash -648164610, now seen corresponding path program 1 times [2023-11-28 20:36:24,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:24,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077268961] [2023-11-28 20:36:24,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:24,690 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:36:24,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:24,691 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:24,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:24,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:36:24,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:24,841 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:24,841 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:24,842 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:36:24,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2023-11-28 20:36:24,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:36:24,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-11-28 20:36:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:36:24,913 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:24,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:24,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077268961] [2023-11-28 20:36:24,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077268961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:24,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:24,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:36:24,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292547115] [2023-11-28 20:36:24,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:24,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:24,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:24,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:24,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:24,916 INFO L87 Difference]: Start difference. First operand 742 states and 832 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:36:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:26,573 INFO L93 Difference]: Finished difference Result 1468 states and 1649 transitions. [2023-11-28 20:36:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:26,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2023-11-28 20:36:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:26,579 INFO L225 Difference]: With dead ends: 1468 [2023-11-28 20:36:26,580 INFO L226 Difference]: Without dead ends: 1468 [2023-11-28 20:36:26,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:36:26,580 INFO L413 NwaCegarLoop]: 841 mSDtfsCounter, 732 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:26,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2330 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-28 20:36:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2023-11-28 20:36:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 744. [2023-11-28 20:36:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 388 states have (on average 2.1030927835051547) internal successors, (816), 737 states have internal predecessors, (816), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-28 20:36:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 834 transitions. [2023-11-28 20:36:26,597 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 834 transitions. Word has length 9 [2023-11-28 20:36:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:26,598 INFO L495 AbstractCegarLoop]: Abstraction has 744 states and 834 transitions. [2023-11-28 20:36:26,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:36:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 834 transitions. [2023-11-28 20:36:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-28 20:36:26,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:26,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:26,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:26,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:26,799 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:26,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:26,799 INFO L85 PathProgramCache]: Analyzing trace with hash -305951994, now seen corresponding path program 1 times [2023-11-28 20:36:26,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:26,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96748109] [2023-11-28 20:36:26,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:26,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:36:26,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:26,801 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:26,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:26,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 20:36:26,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:26,953 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:36:26,953 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:26,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:26,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96748109] [2023-11-28 20:36:26,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96748109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:26,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:26,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:36:26,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931445169] [2023-11-28 20:36:26,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:26,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:36:26,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:26,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:36:26,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:36:26,956 INFO L87 Difference]: Start difference. First operand 744 states and 834 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:36:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:27,680 INFO L93 Difference]: Finished difference Result 705 states and 794 transitions. [2023-11-28 20:36:27,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:36:27,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-28 20:36:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:27,685 INFO L225 Difference]: With dead ends: 705 [2023-11-28 20:36:27,685 INFO L226 Difference]: Without dead ends: 705 [2023-11-28 20:36:27,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:36:27,686 INFO L413 NwaCegarLoop]: 629 mSDtfsCounter, 70 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:27,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1209 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-28 20:36:27,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2023-11-28 20:36:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2023-11-28 20:36:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 373 states have (on average 2.0804289544235925) internal successors, (776), 698 states have internal predecessors, (776), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-28 20:36:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 794 transitions. [2023-11-28 20:36:27,698 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 794 transitions. Word has length 15 [2023-11-28 20:36:27,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:27,698 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 794 transitions. [2023-11-28 20:36:27,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:36:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 794 transitions. [2023-11-28 20:36:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-28 20:36:27,698 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:27,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:27,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-28 20:36:27,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:27,902 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:27,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:27,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1962092576, now seen corresponding path program 1 times [2023-11-28 20:36:27,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:27,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424485353] [2023-11-28 20:36:27,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:27,903 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:36:27,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:27,904 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:27,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:28,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:36:28,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:28,061 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:36:28,061 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:28,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:28,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424485353] [2023-11-28 20:36:28,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424485353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:28,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:28,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:36:28,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65362865] [2023-11-28 20:36:28,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:28,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:28,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:28,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:28,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:28,062 INFO L87 Difference]: Start difference. First operand 705 states and 794 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:36:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:28,760 INFO L93 Difference]: Finished difference Result 691 states and 773 transitions. [2023-11-28 20:36:28,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:28,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2023-11-28 20:36:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:28,764 INFO L225 Difference]: With dead ends: 691 [2023-11-28 20:36:28,764 INFO L226 Difference]: Without dead ends: 691 [2023-11-28 20:36:28,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:36:28,765 INFO L413 NwaCegarLoop]: 598 mSDtfsCounter, 58 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:28,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1770 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-28 20:36:28,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2023-11-28 20:36:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 690. [2023-11-28 20:36:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 372 states have (on average 2.0268817204301075) internal successors, (754), 683 states have internal predecessors, (754), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-28 20:36:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 772 transitions. [2023-11-28 20:36:28,780 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 772 transitions. Word has length 17 [2023-11-28 20:36:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:28,781 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 772 transitions. [2023-11-28 20:36:28,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:36:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 772 transitions. [2023-11-28 20:36:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-28 20:36:28,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:28,782 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] [2023-11-28 20:36:28,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-28 20:36:28,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:28,983 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:28,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:28,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1060196302, now seen corresponding path program 1 times [2023-11-28 20:36:28,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:28,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683869532] [2023-11-28 20:36:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:28,984 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:36:28,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:28,985 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:28,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:29,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:36:29,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:29,142 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:36:29,223 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:36:29,223 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:29,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:29,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683869532] [2023-11-28 20:36:29,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683869532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:29,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:29,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:36:29,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640622564] [2023-11-28 20:36:29,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:29,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:29,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:29,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:29,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:29,225 INFO L87 Difference]: Start difference. First operand 690 states and 772 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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:36:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:31,066 INFO L93 Difference]: Finished difference Result 886 states and 1000 transitions. [2023-11-28 20:36:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:31,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2023-11-28 20:36:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:31,071 INFO L225 Difference]: With dead ends: 886 [2023-11-28 20:36:31,071 INFO L226 Difference]: Without dead ends: 886 [2023-11-28 20:36:31,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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:36:31,072 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 665 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:31,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 750 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-28 20:36:31,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2023-11-28 20:36:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 686. [2023-11-28 20:36:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 372 states have (on average 2.0161290322580645) internal successors, (750), 679 states have internal predecessors, (750), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-28 20:36:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 768 transitions. [2023-11-28 20:36:31,088 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 768 transitions. Word has length 31 [2023-11-28 20:36:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:31,088 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 768 transitions. [2023-11-28 20:36:31,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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:36:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 768 transitions. [2023-11-28 20:36:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-28 20:36:31,089 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:31,090 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] [2023-11-28 20:36:31,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:31,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:31,290 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:31,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:31,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1060196303, now seen corresponding path program 1 times [2023-11-28 20:36:31,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:31,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841237185] [2023-11-28 20:36:31,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:31,291 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:36:31,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:31,292 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:31,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:31,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 20:36:31,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:31,470 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:36:31,642 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:36:31,642 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:31,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:31,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841237185] [2023-11-28 20:36:31,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841237185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:31,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:31,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:36:31,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194726137] [2023-11-28 20:36:31,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:31,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:31,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:31,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:31,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:31,644 INFO L87 Difference]: Start difference. First operand 686 states and 768 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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:36:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:34,296 INFO L93 Difference]: Finished difference Result 929 states and 1011 transitions. [2023-11-28 20:36:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:34,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2023-11-28 20:36:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:34,302 INFO L225 Difference]: With dead ends: 929 [2023-11-28 20:36:34,302 INFO L226 Difference]: Without dead ends: 929 [2023-11-28 20:36:34,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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:36:34,303 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 387 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:34,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1046 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-28 20:36:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2023-11-28 20:36:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 682. [2023-11-28 20:36:34,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 372 states have (on average 2.0053763440860215) internal successors, (746), 675 states have internal predecessors, (746), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-28 20:36:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 764 transitions. [2023-11-28 20:36:34,313 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 764 transitions. Word has length 31 [2023-11-28 20:36:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:34,314 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 764 transitions. [2023-11-28 20:36:34,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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:36:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 764 transitions. [2023-11-28 20:36:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-28 20:36:34,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:34,315 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:36:34,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:34,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:34,519 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:34,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:34,519 INFO L85 PathProgramCache]: Analyzing trace with hash 319790408, now seen corresponding path program 1 times [2023-11-28 20:36:34,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:34,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561878551] [2023-11-28 20:36:34,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:34,520 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:36:34,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:34,521 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:34,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:34,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:36:34,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:34,756 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:36:34,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:34,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:34,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561878551] [2023-11-28 20:36:34,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561878551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:34,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:34,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:36:34,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335297584] [2023-11-28 20:36:34,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:34,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:34,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:34,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:34,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:34,757 INFO L87 Difference]: Start difference. First operand 682 states and 764 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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:36:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:35,523 INFO L93 Difference]: Finished difference Result 676 states and 754 transitions. [2023-11-28 20:36:35,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:35,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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:36:35,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:35,527 INFO L225 Difference]: With dead ends: 676 [2023-11-28 20:36:35,528 INFO L226 Difference]: Without dead ends: 676 [2023-11-28 20:36:35,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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:36:35,528 INFO L413 NwaCegarLoop]: 592 mSDtfsCounter, 23 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:35,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1756 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-28 20:36:35,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2023-11-28 20:36:35,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2023-11-28 20:36:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 366 states have (on average 2.010928961748634) internal successors, (736), 669 states have internal predecessors, (736), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-28 20:36:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 754 transitions. [2023-11-28 20:36:35,539 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 754 transitions. Word has length 47 [2023-11-28 20:36:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:35,539 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 754 transitions. [2023-11-28 20:36:35,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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:36:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 754 transitions. [2023-11-28 20:36:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-28 20:36:35,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:35,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:35,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:35,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:35,742 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:35,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash 193945193, now seen corresponding path program 1 times [2023-11-28 20:36:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:35,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844306539] [2023-11-28 20:36:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:35,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:36:35,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:35,745 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:35,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:35,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:36:35,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:36,179 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:36:36,179 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:36,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:36,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844306539] [2023-11-28 20:36:36,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844306539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:36,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:36,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:36:36,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527964291] [2023-11-28 20:36:36,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:36,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:36:36,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:36,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:36:36,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:36:36,181 INFO L87 Difference]: Start difference. First operand 676 states and 754 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:36:36,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:36,897 INFO L93 Difference]: Finished difference Result 857 states and 958 transitions. [2023-11-28 20:36:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:36:36,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-11-28 20:36:36,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:36,902 INFO L225 Difference]: With dead ends: 857 [2023-11-28 20:36:36,902 INFO L226 Difference]: Without dead ends: 857 [2023-11-28 20:36:36,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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:36:36,902 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 205 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:36,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1227 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-28 20:36:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2023-11-28 20:36:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 803. [2023-11-28 20:36:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 488 states have (on average 1.8995901639344261) internal successors, (927), 796 states have internal predecessors, (927), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-28 20:36:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 955 transitions. [2023-11-28 20:36:36,921 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 955 transitions. Word has length 51 [2023-11-28 20:36:36,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:36,921 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 955 transitions. [2023-11-28 20:36:36,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:36:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 955 transitions. [2023-11-28 20:36:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-28 20:36:36,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:36,922 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:36:36,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:37,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:37,128 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:37,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:37,128 INFO L85 PathProgramCache]: Analyzing trace with hash 982802402, now seen corresponding path program 1 times [2023-11-28 20:36:37,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:37,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330804065] [2023-11-28 20:36:37,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:37,129 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:36:37,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:37,129 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:37,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:37,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-28 20:36:37,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:37,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 7 [2023-11-28 20:36:37,403 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:36:37,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:36:37,813 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:36:37,824 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:36:37,824 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:36:37,837 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:36:37,837 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:37,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:37,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330804065] [2023-11-28 20:36:37,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330804065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:37,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:37,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:36:37,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477624019] [2023-11-28 20:36:37,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:37,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:37,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:37,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:37,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:37,839 INFO L87 Difference]: Start difference. First operand 803 states and 955 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 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:36:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:40,060 INFO L93 Difference]: Finished difference Result 1046 states and 1304 transitions. [2023-11-28 20:36:40,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:40,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 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:36:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:40,065 INFO L225 Difference]: With dead ends: 1046 [2023-11-28 20:36:40,065 INFO L226 Difference]: Without dead ends: 1046 [2023-11-28 20:36:40,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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:36:40,066 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 1354 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:40,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 295 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-28 20:36:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2023-11-28 20:36:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 742. [2023-11-28 20:36:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 465 states have (on average 1.789247311827957) internal successors, (832), 735 states have internal predecessors, (832), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-28 20:36:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 860 transitions. [2023-11-28 20:36:40,078 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 860 transitions. Word has length 54 [2023-11-28 20:36:40,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:40,078 INFO L495 AbstractCegarLoop]: Abstraction has 742 states and 860 transitions. [2023-11-28 20:36:40,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 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:36:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 860 transitions. [2023-11-28 20:36:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-28 20:36:40,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:40,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, 1, 1, 1, 1] [2023-11-28 20:36:40,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-28 20:36:40,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:40,284 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:40,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:40,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1507704915, now seen corresponding path program 1 times [2023-11-28 20:36:40,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:40,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873950856] [2023-11-28 20:36:40,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:40,285 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:36:40,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:40,286 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:40,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:40,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-28 20:36:40,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:40,544 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:36:40,555 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:36:40,577 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:36:40,586 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:36:40,586 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:40,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:40,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873950856] [2023-11-28 20:36:40,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873950856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:40,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:40,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:36:40,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372825054] [2023-11-28 20:36:40,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:40,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:36:40,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:40,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:36:40,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:36:40,588 INFO L87 Difference]: Start difference. First operand 742 states and 860 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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:36:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:42,535 INFO L93 Difference]: Finished difference Result 741 states and 859 transitions. [2023-11-28 20:36:42,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:36:42,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2023-11-28 20:36:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:42,539 INFO L225 Difference]: With dead ends: 741 [2023-11-28 20:36:42,540 INFO L226 Difference]: Without dead ends: 741 [2023-11-28 20:36:42,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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:36:42,540 INFO L413 NwaCegarLoop]: 566 mSDtfsCounter, 3 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:42,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1508 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-28 20:36:42,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2023-11-28 20:36:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2023-11-28 20:36:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 465 states have (on average 1.7870967741935484) internal successors, (831), 734 states have internal predecessors, (831), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-28 20:36:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 859 transitions. [2023-11-28 20:36:42,555 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 859 transitions. Word has length 58 [2023-11-28 20:36:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:42,555 INFO L495 AbstractCegarLoop]: Abstraction has 741 states and 859 transitions. [2023-11-28 20:36:42,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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:36:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 859 transitions. [2023-11-28 20:36:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-28 20:36:42,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:42,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:42,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:42,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:42,760 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:42,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1507704916, now seen corresponding path program 1 times [2023-11-28 20:36:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:42,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65291573] [2023-11-28 20:36:42,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:42,760 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:36:42,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:42,761 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:42,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:42,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-28 20:36:42,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:42,996 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:36:43,023 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:36:43,030 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:36:43,064 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:36:43,080 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:36:43,080 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:43,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:43,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65291573] [2023-11-28 20:36:43,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65291573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:43,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:43,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:36:43,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769536896] [2023-11-28 20:36:43,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:43,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:36:43,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:43,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:36:43,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:36:43,082 INFO L87 Difference]: Start difference. First operand 741 states and 859 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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:36:45,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:45,549 INFO L93 Difference]: Finished difference Result 740 states and 858 transitions. [2023-11-28 20:36:45,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:36:45,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2023-11-28 20:36:45,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:45,554 INFO L225 Difference]: With dead ends: 740 [2023-11-28 20:36:45,554 INFO L226 Difference]: Without dead ends: 740 [2023-11-28 20:36:45,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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:36:45,554 INFO L413 NwaCegarLoop]: 566 mSDtfsCounter, 1 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:45,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1528 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-28 20:36:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2023-11-28 20:36:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2023-11-28 20:36:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 464 states have (on average 1.7887931034482758) internal successors, (830), 733 states have internal predecessors, (830), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-28 20:36:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 858 transitions. [2023-11-28 20:36:45,565 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 858 transitions. Word has length 58 [2023-11-28 20:36:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:45,565 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 858 transitions. [2023-11-28 20:36:45,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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:36:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 858 transitions. [2023-11-28 20:36:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-28 20:36:45,566 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:45,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:45,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:45,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:45,767 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:45,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:45,768 INFO L85 PathProgramCache]: Analyzing trace with hash -472355529, now seen corresponding path program 1 times [2023-11-28 20:36:45,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:45,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071971739] [2023-11-28 20:36:45,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:45,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:45,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:45,769 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:45,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:45,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:36:45,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:46,014 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:36:46,014 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:46,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:46,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071971739] [2023-11-28 20:36:46,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071971739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:46,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:46,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:36:46,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929138544] [2023-11-28 20:36:46,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:46,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:46,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:46,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:46,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:46,016 INFO L87 Difference]: Start difference. First operand 740 states and 858 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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:36:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:46,899 INFO L93 Difference]: Finished difference Result 742 states and 861 transitions. [2023-11-28 20:36:46,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:46,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2023-11-28 20:36:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:46,904 INFO L225 Difference]: With dead ends: 742 [2023-11-28 20:36:46,905 INFO L226 Difference]: Without dead ends: 742 [2023-11-28 20:36:46,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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:36:46,905 INFO L413 NwaCegarLoop]: 566 mSDtfsCounter, 1 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:46,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1695 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-28 20:36:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2023-11-28 20:36:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2023-11-28 20:36:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 465 states have (on average 1.789247311827957) internal successors, (832), 735 states have internal predecessors, (832), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-28 20:36:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 861 transitions. [2023-11-28 20:36:46,921 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 861 transitions. Word has length 64 [2023-11-28 20:36:46,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:46,921 INFO L495 AbstractCegarLoop]: Abstraction has 742 states and 861 transitions. [2023-11-28 20:36:46,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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:36:46,922 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 861 transitions. [2023-11-28 20:36:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-28 20:36:46,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:46,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:46,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:47,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:47,123 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:47,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:47,123 INFO L85 PathProgramCache]: Analyzing trace with hash -152099169, now seen corresponding path program 1 times [2023-11-28 20:36:47,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:47,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35726072] [2023-11-28 20:36:47,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:47,124 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:36:47,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:47,124 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:47,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:36:47,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:47,398 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:36:47,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:36:47,457 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:36:47,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:47,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35726072] [2023-11-28 20:36:47,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35726072] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:36:47,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:36:47,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-28 20:36:47,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520365435] [2023-11-28 20:36:47,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:36:47,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:36:47,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:47,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:36:47,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:36:47,460 INFO L87 Difference]: Start difference. First operand 742 states and 861 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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:36:48,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:48,586 INFO L93 Difference]: Finished difference Result 751 states and 875 transitions. [2023-11-28 20:36:48,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 20:36:48,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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 65 [2023-11-28 20:36:48,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:48,590 INFO L225 Difference]: With dead ends: 751 [2023-11-28 20:36:48,590 INFO L226 Difference]: Without dead ends: 751 [2023-11-28 20:36:48,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 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:36:48,591 INFO L413 NwaCegarLoop]: 565 mSDtfsCounter, 6 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:48,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2818 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-28 20:36:48,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2023-11-28 20:36:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 750. [2023-11-28 20:36:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 472 states have (on average 1.7902542372881356) internal successors, (845), 742 states have internal predecessors, (845), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-28 20:36:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 874 transitions. [2023-11-28 20:36:48,605 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 874 transitions. Word has length 65 [2023-11-28 20:36:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:48,605 INFO L495 AbstractCegarLoop]: Abstraction has 750 states and 874 transitions. [2023-11-28 20:36:48,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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:36:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 874 transitions. [2023-11-28 20:36:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-28 20:36:48,606 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:48,606 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:48,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-28 20:36:48,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:48,807 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:48,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:48,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1349486391, now seen corresponding path program 2 times [2023-11-28 20:36:48,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:48,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519491067] [2023-11-28 20:36:48,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:36:48,808 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:36:48,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:48,809 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:48,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:49,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:36:49,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:36:49,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-28 20:36:49,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:49,285 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:36:49,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:36:49,409 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:36:49,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:49,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519491067] [2023-11-28 20:36:49,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519491067] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:36:49,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:36:49,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-28 20:36:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899220078] [2023-11-28 20:36:49,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:36:49,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 20:36:49,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:49,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 20:36:49,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-28 20:36:49,411 INFO L87 Difference]: Start difference. First operand 750 states and 874 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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:36:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:51,206 INFO L93 Difference]: Finished difference Result 765 states and 896 transitions. [2023-11-28 20:36:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-28 20:36:51,207 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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 68 [2023-11-28 20:36:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:51,211 INFO L225 Difference]: With dead ends: 765 [2023-11-28 20:36:51,211 INFO L226 Difference]: Without dead ends: 763 [2023-11-28 20:36:51,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-28 20:36:51,212 INFO L413 NwaCegarLoop]: 565 mSDtfsCounter, 13 mSDsluCounter, 2820 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:51,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3385 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-28 20:36:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2023-11-28 20:36:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 759. [2023-11-28 20:36:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 481 states have (on average 1.7817047817047817) internal successors, (857), 751 states have internal predecessors, (857), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-28 20:36:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 886 transitions. [2023-11-28 20:36:51,223 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 886 transitions. Word has length 68 [2023-11-28 20:36:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:51,223 INFO L495 AbstractCegarLoop]: Abstraction has 759 states and 886 transitions. [2023-11-28 20:36:51,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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:36:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 886 transitions. [2023-11-28 20:36:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-28 20:36:51,224 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:51,224 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:51,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:51,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:51,425 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:51,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:51,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1421619657, now seen corresponding path program 3 times [2023-11-28 20:36:51,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:51,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095659941] [2023-11-28 20:36:51,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 20:36:51,425 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:36:51,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:51,426 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:51,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:52,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-28 20:36:52,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:36:52,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-28 20:36:52,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:52,176 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:36:52,176 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:36:52,772 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:36:52,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:52,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095659941] [2023-11-28 20:36:52,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095659941] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:36:52,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:36:52,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-28 20:36:52,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181681605] [2023-11-28 20:36:52,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:36:52,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-28 20:36:52,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:52,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-28 20:36:52,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-28 20:36:52,775 INFO L87 Difference]: Start difference. First operand 759 states and 886 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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:36:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:57,366 INFO L93 Difference]: Finished difference Result 789 states and 936 transitions. [2023-11-28 20:36:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-28 20:36:57,367 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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 74 [2023-11-28 20:36:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:57,370 INFO L225 Difference]: With dead ends: 789 [2023-11-28 20:36:57,370 INFO L226 Difference]: Without dead ends: 786 [2023-11-28 20:36:57,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-28 20:36:57,371 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 24 mSDsluCounter, 6191 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 6755 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:57,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 6755 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-28 20:36:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2023-11-28 20:36:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 777. [2023-11-28 20:36:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 499 states have (on average 1.7635270541082164) internal successors, (880), 769 states have internal predecessors, (880), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-28 20:36:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 909 transitions. [2023-11-28 20:36:57,383 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 909 transitions. Word has length 74 [2023-11-28 20:36:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:57,383 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 909 transitions. [2023-11-28 20:36:57,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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:36:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 909 transitions. [2023-11-28 20:36:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-28 20:36:57,384 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:57,384 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:57,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:57,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:36:57,585 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:36:57,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:57,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2060936137, now seen corresponding path program 4 times [2023-11-28 20:36:57,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:57,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362699444] [2023-11-28 20:36:57,586 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 20:36:57,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:57,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:57,587 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:36:57,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-28 20:36:57,938 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 20:36:57,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:36:57,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-28 20:36:57,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:58,268 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:36:58,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:36:59,667 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:36:59,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:59,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362699444] [2023-11-28 20:36:59,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362699444] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:36:59,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:36:59,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-28 20:36:59,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088236618] [2023-11-28 20:36:59,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:36:59,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-28 20:36:59,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:59,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-28 20:36:59,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-28 20:36:59,671 INFO L87 Difference]: Start difference. First operand 777 states and 909 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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:37:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:11,709 INFO L93 Difference]: Finished difference Result 834 states and 998 transitions. [2023-11-28 20:37:11,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-28 20:37:11,710 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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 86 [2023-11-28 20:37:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:11,714 INFO L225 Difference]: With dead ends: 834 [2023-11-28 20:37:11,714 INFO L226 Difference]: Without dead ends: 832 [2023-11-28 20:37:11,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 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:37:11,719 INFO L413 NwaCegarLoop]: 565 mSDtfsCounter, 47 mSDsluCounter, 12972 mSDsCounter, 0 mSdLazyCounter, 4260 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 13537 SdHoareTripleChecker+Invalid, 4334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 4260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:11,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 13537 Invalid, 4334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 4260 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2023-11-28 20:37:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2023-11-28 20:37:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 811. [2023-11-28 20:37:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 533 states have (on average 1.7373358348968104) internal successors, (926), 803 states have internal predecessors, (926), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-28 20:37:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 955 transitions. [2023-11-28 20:37:11,739 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 955 transitions. Word has length 86 [2023-11-28 20:37:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:11,739 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 955 transitions. [2023-11-28 20:37:11,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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:37:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 955 transitions. [2023-11-28 20:37:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-28 20:37:11,740 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:11,741 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:37:11,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-28 20:37:11,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:37:11,941 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:37:11,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1704692535, now seen corresponding path program 5 times [2023-11-28 20:37:11,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:37:11,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311420173] [2023-11-28 20:37:11,942 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 20:37:11,942 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:37:11,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:37:11,943 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:37:11,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:37:13,222 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-28 20:37:13,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:37:13,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-28 20:37:13,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:37:13,257 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:37:13,355 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:37:13,356 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:37:13,382 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:37:13,477 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:37:14,394 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:37:14,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:37:14,429 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:37:14,456 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:37:14,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:37:18,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:37:18,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311420173] [2023-11-28 20:37:18,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311420173] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:37:18,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1737960920] [2023-11-28 20:37:18,862 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 20:37:18,862 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:37:18,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:37:18,863 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:37:18,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-28 20:38:14,976 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-28 20:38:14,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:38:15,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-28 20:38:15,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:38:15,198 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:38:15,469 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:38:15,470 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:38:15,543 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:38:15,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-28 20:38:16,622 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:38:16,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:38:16,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-28 20:38:16,715 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:38:16,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:38:17,079 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2463) |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:38:17,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1737960920] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:38:17,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:38:17,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-28 20:38:17,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7931299] [2023-11-28 20:38:17,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:38:17,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-28 20:38:17,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:38:17,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-28 20:38:17,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=187, Unknown=2, NotChecked=28, Total=272 [2023-11-28 20:38:17,083 INFO L87 Difference]: Start difference. First operand 811 states and 955 transitions. Second operand has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:38:22,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:38:22,420 INFO L93 Difference]: Finished difference Result 1093 states and 1341 transitions. [2023-11-28 20:38:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:38:22,421 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-28 20:38:22,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:38:22,426 INFO L225 Difference]: With dead ends: 1093 [2023-11-28 20:38:22,426 INFO L226 Difference]: Without dead ends: 1091 [2023-11-28 20:38:22,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=64, Invalid=210, Unknown=2, NotChecked=30, Total=306 [2023-11-28 20:38:22,427 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 553 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:38:22,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 2102 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-11-28 20:38:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2023-11-28 20:38:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 810. [2023-11-28 20:38:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 533 states have (on average 1.727954971857411) internal successors, (921), 802 states have internal predecessors, (921), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-28 20:38:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 950 transitions. [2023-11-28 20:38:22,445 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 950 transitions. Word has length 108 [2023-11-28 20:38:22,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:38:22,445 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 950 transitions. [2023-11-28 20:38:22,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:38:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 950 transitions. [2023-11-28 20:38:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-28 20:38:22,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:38:22,447 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:38:22,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-28 20:38:22,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:38:22,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:38:22,847 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:38:22,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1704692536, now seen corresponding path program 1 times [2023-11-28 20:38:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:38:22,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272724930] [2023-11-28 20:38:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:22,848 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:38:22,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:38:22,849 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:38:22,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:38:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:23,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-28 20:38:23,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:38:23,529 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:38:23,652 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:38:23,653 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:38:23,659 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:38:23,686 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:38:23,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-28 20:38:23,793 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:38:23,797 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:38:24,563 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:38:24,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:38:24,576 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:38:24,621 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:38:24,625 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:38:24,649 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:38:24,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:38:26,036 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3017 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3017) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3016 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3017) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3016) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 20:38:26,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:38:26,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272724930] [2023-11-28 20:38:26,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272724930] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:38:26,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1436317544] [2023-11-28 20:38:26,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:26,042 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:38:26,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:38:26,043 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:38:26,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-28 20:40:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:03,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-28 20:40:03,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:40:03,839 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:40:04,167 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:40:04,167 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:40:04,174 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:40:04,232 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:40:04,245 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:40:04,403 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:40:04,407 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:40:05,109 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:40:05,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:40:05,118 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:40:05,201 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:40:05,206 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:40:05,210 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:05,210 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:40:06,498 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3571 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3570) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3571) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3570) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-28 20:40:06,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1436317544] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:40:06,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:40:06,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-28 20:40:06,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033909443] [2023-11-28 20:40:06,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:40:06,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-28 20:40:06,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:40:06,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-28 20:40:06,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-28 20:40:06,504 INFO L87 Difference]: Start difference. First operand 810 states and 950 transitions. Second operand has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:40:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:14,915 INFO L93 Difference]: Finished difference Result 1090 states and 1336 transitions. [2023-11-28 20:40:14,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:40:14,916 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-28 20:40:14,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:14,920 INFO L225 Difference]: With dead ends: 1090 [2023-11-28 20:40:14,920 INFO L226 Difference]: Without dead ends: 1090 [2023-11-28 20:40:14,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-11-28 20:40:14,921 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 1066 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 3742 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 3762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:14,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1734 Invalid, 3762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3742 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2023-11-28 20:40:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2023-11-28 20:40:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 809. [2023-11-28 20:40:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 533 states have (on average 1.726078799249531) internal successors, (920), 801 states have internal predecessors, (920), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-28 20:40:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 949 transitions. [2023-11-28 20:40:14,935 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 949 transitions. Word has length 108 [2023-11-28 20:40:14,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:14,935 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 949 transitions. [2023-11-28 20:40:14,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:40:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 949 transitions. [2023-11-28 20:40:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-28 20:40:14,936 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:14,936 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:40:14,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-11-28 20:40:15,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-11-28 20:40:15,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 20:40:15,337 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:40:15,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:15,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1828123214, now seen corresponding path program 1 times [2023-11-28 20:40:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:40:15,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895064222] [2023-11-28 20:40:15,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:15,338 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:40:15,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:40:15,339 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:40:15,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:40:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:16,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-28 20:40:16,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:40:16,092 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:40:16,230 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:40:16,230 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:40:16,259 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:40:16,361 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:40:17,203 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:40:17,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:40:17,331 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:40:17,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-28 20:40:17,351 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:40:17,385 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:17,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:40:21,492 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3995) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-28 20:40:21,883 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4041))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3995)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 20:40:21,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:40:21,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895064222] [2023-11-28 20:40:21,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895064222] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:40:21,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [18315515] [2023-11-28 20:40:21,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:21,886 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:40:21,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:40:21,886 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:40:21,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-28 20:40:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:23,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-28 20:40:23,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:40:23,810 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:40:24,131 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:40:24,131 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:40:24,194 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:40:24,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-28 20:40:25,193 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:40:25,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:40:25,330 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:40:25,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:40:25,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-28 20:40:25,351 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:25,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:40:25,365 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4465) |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:40:25,375 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:40:25,759 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4511))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4465)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:40:25,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [18315515] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:40:25,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:40:25,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-28 20:40:25,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367888114] [2023-11-28 20:40:25,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:40:25,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-28 20:40:25,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:40:25,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-28 20:40:25,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=244, Unknown=6, NotChecked=180, Total=506 [2023-11-28 20:40:25,763 INFO L87 Difference]: Start difference. First operand 809 states and 949 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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:40:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:40:31,701 INFO L93 Difference]: Finished difference Result 1089 states and 1335 transitions. [2023-11-28 20:40:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 20:40:31,702 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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 110 [2023-11-28 20:40:31,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:40:31,705 INFO L225 Difference]: With dead ends: 1089 [2023-11-28 20:40:31,705 INFO L226 Difference]: Without dead ends: 1089 [2023-11-28 20:40:31,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=85, Invalid=271, Unknown=6, NotChecked=190, Total=552 [2023-11-28 20:40:31,706 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 552 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 2337 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:40:31,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 2337 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2571 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-11-28 20:40:31,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2023-11-28 20:40:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 808. [2023-11-28 20:40:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 533 states have (on average 1.724202626641651) internal successors, (919), 800 states have internal predecessors, (919), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-28 20:40:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 948 transitions. [2023-11-28 20:40:31,717 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 948 transitions. Word has length 110 [2023-11-28 20:40:31,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:40:31,718 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 948 transitions. [2023-11-28 20:40:31,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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:40:31,718 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 948 transitions. [2023-11-28 20:40:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-28 20:40:31,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:40:31,719 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:40:31,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-28 20:40:31,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:40:32,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:40:32,119 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:40:32,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:40:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1828123215, now seen corresponding path program 1 times [2023-11-28 20:40:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:40:32,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812195572] [2023-11-28 20:40:32,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:32,120 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:40:32,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:40:32,121 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:40:32,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:40:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:40:32,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-28 20:40:32,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:40:32,927 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:40:33,044 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:40:33,045 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:40:33,051 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:40:33,078 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:40:33,090 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:40:33,195 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:40:33,201 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:40:33,921 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:40:33,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:40:33,931 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:40:34,064 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:40:34,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-28 20:40:34,070 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:40:34,088 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:40:34,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 9 treesize of output 3 [2023-11-28 20:40:34,117 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:34,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:40:34,262 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4981) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4981) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-11-28 20:40:34,294 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_4981) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_4981) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_4980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-28 20:40:35,672 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4980 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5073))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5072) .cse0 v_ArrVal_4981) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4980) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5073 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4981 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5072) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5073) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4981) |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:40:35,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:40:35,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812195572] [2023-11-28 20:40:35,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812195572] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:40:35,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2087904678] [2023-11-28 20:40:35,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:40:35,683 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:40:35,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:40:35,684 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:40:35,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-28 20:42:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:16,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-28 20:42:16,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:42:16,376 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:16,654 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:16,669 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:42:16,669 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:16,727 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:16,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-28 20:42:16,891 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:16,895 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:17,545 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:42:17,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:17,550 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:17,729 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:42:17,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:17,740 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:17,755 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:17,768 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:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-28 20:42:17,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:42:17,824 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5543) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-11-28 20:42:17,860 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_5543) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-28 20:42:19,189 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5635))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5634) .cse0 v_ArrVal_5542) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5543) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5634) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5542) |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:42:19,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2087904678] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:42:19,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:42:19,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-28 20:42:19,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261131706] [2023-11-28 20:42:19,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:42:19,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-28 20:42:19,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:42:19,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-28 20:42:19,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-28 20:42:19,201 INFO L87 Difference]: Start difference. First operand 808 states and 948 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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:42:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:42:29,150 INFO L93 Difference]: Finished difference Result 1088 states and 1334 transitions. [2023-11-28 20:42:29,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 20:42:29,151 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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 110 [2023-11-28 20:42:29,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:42:29,155 INFO L225 Difference]: With dead ends: 1088 [2023-11-28 20:42:29,155 INFO L226 Difference]: Without dead ends: 1088 [2023-11-28 20:42:29,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-28 20:42:29,155 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 557 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 4298 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 2068 SdHoareTripleChecker+Invalid, 4306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 4298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:42:29,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 2068 Invalid, 4306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 4298 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2023-11-28 20:42:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2023-11-28 20:42:29,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 807. [2023-11-28 20:42:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 533 states have (on average 1.722326454033771) internal successors, (918), 799 states have internal predecessors, (918), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-28 20:42:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 947 transitions. [2023-11-28 20:42:29,167 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 947 transitions. Word has length 110 [2023-11-28 20:42:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:42:29,167 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 947 transitions. [2023-11-28 20:42:29,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 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:42:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 947 transitions. [2023-11-28 20:42:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-28 20:42:29,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:42:29,168 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:42:29,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-11-28 20:42:29,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-28 20:42:29,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:42:29,569 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:42:29,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:42:29,569 INFO L85 PathProgramCache]: Analyzing trace with hash 185916864, now seen corresponding path program 1 times [2023-11-28 20:42:29,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:42:29,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083168131] [2023-11-28 20:42:29,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:29,570 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:42:29,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:42:29,571 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:42:29,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:42:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:42:30,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-28 20:42:30,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:42:30,474 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:30,604 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:42:30,604 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:42:30,641 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:42:30,740 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:42:31,750 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:42:31,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:42:31,869 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:42:31,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:42:31,952 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:42:31,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:42:31,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-28 20:42:32,009 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:32,009 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:42:32,072 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6075) |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:42:32,084 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6075 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6075) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-11-28 20:42:32,099 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6074))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6075)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:42:32,113 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6075 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6074))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6075)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:42:32,493 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6121 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6121))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6074)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6075)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:42:32,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:42:32,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083168131] [2023-11-28 20:42:32,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083168131] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:42:32,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1056822299] [2023-11-28 20:42:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:42:32,497 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:42:32,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:42:32,497 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:42:32,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-28 20:43:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:02,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-28 20:43:02,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:43:02,227 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:02,573 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:43:02,573 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:02,654 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:02,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-28 20:43:03,715 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:43:03,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:43:03,921 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:43:03,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:43:04,011 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:43:04,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:43:04,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-28 20:43:04,037 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:04,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:43:04,051 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6561) |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:43:04,062 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6561) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-28 20:43:04,077 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6560))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6561)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-28 20:43:04,093 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6560))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6561)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:43:04,548 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6607))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6560)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6561)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:43:04,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1056822299] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:43:04,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:43:04,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-28 20:43:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939580320] [2023-11-28 20:43:04,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:43:04,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-28 20:43:04,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:43:04,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-28 20:43:04,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=277, Unknown=10, NotChecked=430, Total=812 [2023-11-28 20:43:04,553 INFO L87 Difference]: Start difference. First operand 807 states and 947 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 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:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:43:12,822 INFO L93 Difference]: Finished difference Result 1087 states and 1333 transitions. [2023-11-28 20:43:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 20:43:12,823 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 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:43:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:43:12,827 INFO L225 Difference]: With dead ends: 1087 [2023-11-28 20:43:12,827 INFO L226 Difference]: Without dead ends: 1087 [2023-11-28 20:43:12,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=306, Unknown=10, NotChecked=450, Total=870 [2023-11-28 20:43:12,827 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 1039 mSDsluCounter, 2768 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 3544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:43:12,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 3085 Invalid, 3544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3528 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2023-11-28 20:43:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2023-11-28 20:43:12,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 806. [2023-11-28 20:43:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 533 states have (on average 1.7204502814258913) internal successors, (917), 798 states have internal predecessors, (917), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-28 20:43:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 946 transitions. [2023-11-28 20:43:12,839 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 946 transitions. Word has length 112 [2023-11-28 20:43:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:43:12,840 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 946 transitions. [2023-11-28 20:43:12,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 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:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 946 transitions. [2023-11-28 20:43:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-28 20:43:12,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:43:12,841 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:43:12,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:43:13,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-28 20:43:13,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 20:43:13,241 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:43:13,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:43:13,242 INFO L85 PathProgramCache]: Analyzing trace with hash 185916865, now seen corresponding path program 1 times [2023-11-28 20:43:13,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:43:13,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402912431] [2023-11-28 20:43:13,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:13,242 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:13,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:43:13,243 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:13,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:43:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:14,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-28 20:43:14,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:43:14,355 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:14,487 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:43:14,487 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:14,493 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:14,525 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:14,534 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:14,638 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:14,643 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:15,332 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:43:15,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:15,346 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:15,474 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:43:15,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-28 20:43:15,480 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:15,581 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:43:15,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:15,594 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:15,609 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:15,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 9 treesize of output 3 [2023-11-28 20:43:15,648 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:15,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:43:15,810 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-28 20:43:15,842 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-28 20:43:15,883 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7092))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7091) .cse0 v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7091) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-28 20:43:15,923 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7092))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7091) .cse1 v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7091) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-28 20:43:18,143 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7185))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7186) .cse1 v_ArrVal_7091) (select (select (store .cse2 .cse1 v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7094))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7185))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7092))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7186) .cse4 v_ArrVal_7091) .cse5 v_ArrVal_7094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-28 20:43:18,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:43:18,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402912431] [2023-11-28 20:43:18,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402912431] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:43:18,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1619369265] [2023-11-28 20:43:18,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:43:18,161 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:43:18,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:43:18,169 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:43:18,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-28 20:43:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:43:48,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-28 20:43:48,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:43:48,724 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:49,270 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:49,301 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:43:49,301 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:49,439 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:49,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:43:49,736 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:49,743 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:50,843 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:43:50,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-28 20:43:50,856 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:51,138 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:43:51,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-28 20:43:51,149 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:51,321 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:43:51,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:51,332 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:51,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-28 20:43:51,366 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:51,373 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:51,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:43:51,445 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-28 20:43:51,486 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-28 20:43:51,606 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7671))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7670) .cse0 v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7670) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7673) |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:43:51,715 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7671))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7670) .cse1 v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7670) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-28 20:43:54,939 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7764))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7765) .cse1 v_ArrVal_7670) (select (select (store .cse2 .cse1 v_ArrVal_7671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7673))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7764))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7671))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7765) .cse4 v_ArrVal_7670) .cse5 v_ArrVal_7673) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-28 20:43:54,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1619369265] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:43:54,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:43:54,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-28 20:43:54,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028107944] [2023-11-28 20:43:54,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:43:54,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-28 20:43:54,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:43:54,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-28 20:43:54,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-28 20:43:54,955 INFO L87 Difference]: Start difference. First operand 806 states and 946 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 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:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:44:04,347 INFO L93 Difference]: Finished difference Result 1086 states and 1332 transitions. [2023-11-28 20:44:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 20:44:04,348 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 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:44:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:44:04,353 INFO L225 Difference]: With dead ends: 1086 [2023-11-28 20:44:04,353 INFO L226 Difference]: Without dead ends: 1086 [2023-11-28 20:44:04,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-28 20:44:04,354 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 1056 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:44:04,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1206 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2023-11-28 20:44:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2023-11-28 20:44:04,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 805. [2023-11-28 20:44:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 533 states have (on average 1.7185741088180113) internal successors, (916), 797 states have internal predecessors, (916), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-28 20:44:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 945 transitions. [2023-11-28 20:44:04,366 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 945 transitions. Word has length 112 [2023-11-28 20:44:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:44:04,366 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 945 transitions. [2023-11-28 20:44:04,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 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:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 945 transitions. [2023-11-28 20:44:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-28 20:44:04,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:44:04,367 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:44:04,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:44:04,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-28 20:44:04,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 20:44:04,768 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:44:04,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:44:04,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1721393396, now seen corresponding path program 1 times [2023-11-28 20:44:04,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:44:04,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136098552] [2023-11-28 20:44:04,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:04,769 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:04,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:44:04,770 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:04,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:44:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:06,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-28 20:44:06,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:44:06,031 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:06,324 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:44:06,324 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:44:06,375 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:06,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-28 20:44:07,939 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:44:07,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:44:08,108 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:44:08,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:44:08,255 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:44:08,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:44:08,399 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:44:08,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:44:08,417 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:44:08,485 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:08,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:44:09,003 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-28 20:44:09,027 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8220))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8221)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:44:09,050 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8220 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8220))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8221)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:44:09,078 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8219))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8220)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8221)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:44:09,106 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8219))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8220)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8221)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:44:09,674 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8220 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8219 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8267 (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 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8267))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8219)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8220)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8221)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 20:44:09,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:44:09,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136098552] [2023-11-28 20:44:09,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136098552] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:44:09,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1543548198] [2023-11-28 20:44:09,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:44:09,681 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:44:09,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:44:09,682 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:44:09,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-28 20:44:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:44:48,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-28 20:44:48,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:44:48,525 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:49,117 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:44:49,117 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:44:49,232 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:49,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-28 20:44:50,793 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:44:50,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:44:51,086 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:44:51,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:44:51,268 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:44:51,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:44:51,441 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:44:51,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:44:51,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 27 treesize of output 15 [2023-11-28 20:44:51,481 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:51,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:44:55,619 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8722 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8722))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8221)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:44:55,641 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8722 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8722))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8221)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:44:55,672 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8722 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8721))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8722)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8221)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 20:44:55,700 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8722 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8721))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8722)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8221)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-28 20:44:56,262 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8769 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8722 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8769))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8721)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8722)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8221)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:44:56,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1543548198] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:44:56,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:44:56,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-28 20:44:56,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433250755] [2023-11-28 20:44:56,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:44:56,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:44:56,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:44:56,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:44:56,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=379, Unknown=12, NotChecked=550, Total=1056 [2023-11-28 20:44:56,268 INFO L87 Difference]: Start difference. First operand 805 states and 945 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 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:45:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:45:06,870 INFO L93 Difference]: Finished difference Result 1085 states and 1331 transitions. [2023-11-28 20:45:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-28 20:45:06,870 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 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 114 [2023-11-28 20:45:06,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:45:06,875 INFO L225 Difference]: With dead ends: 1085 [2023-11-28 20:45:06,876 INFO L226 Difference]: Without dead ends: 1085 [2023-11-28 20:45:06,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=124, Invalid=414, Unknown=12, NotChecked=572, Total=1122 [2023-11-28 20:45:06,876 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 1031 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:45:06,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 2493 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2023-11-28 20:45:06,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2023-11-28 20:45:06,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 804. [2023-11-28 20:45:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 533 states have (on average 1.7166979362101313) internal successors, (915), 796 states have internal predecessors, (915), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-28 20:45:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 944 transitions. [2023-11-28 20:45:06,896 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 944 transitions. Word has length 114 [2023-11-28 20:45:06,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:45:06,896 INFO L495 AbstractCegarLoop]: Abstraction has 804 states and 944 transitions. [2023-11-28 20:45:06,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 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:45:06,896 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 944 transitions. [2023-11-28 20:45:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-28 20:45:06,897 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:45:06,897 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:45:06,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-28 20:45:07,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:45:07,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:07,298 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:45:07,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:45:07,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1721393395, now seen corresponding path program 1 times [2023-11-28 20:45:07,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:45:07,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401652741] [2023-11-28 20:45:07,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:45:07,299 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:07,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:45:07,300 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:45:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:45:08,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-28 20:45:08,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:45:08,573 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:08,826 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:45:08,826 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:08,838 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:45:08,886 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:08,905 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:45:09,075 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:45:09,083 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:45:10,261 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:45:10,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 62 treesize of output 57 [2023-11-28 20:45:10,271 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:45:10,462 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:45:10,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:45:10,472 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:45:10,629 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:45:10,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-28 20:45:10,651 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:45:10,811 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:45:10,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:45:10,826 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:45:10,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 31 treesize of output 13 [2023-11-28 20:45:10,867 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:45:10,922 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:10,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:45:11,157 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9272) |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:11,198 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-28 20:45:11,269 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9270))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9271) .cse0 v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9271) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9272) |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:45:11,354 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9270))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9271) .cse1 v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9271) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-28 20:45:13,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_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9268))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9269) .cse1 v_ArrVal_9271) (select (select (store .cse2 .cse1 v_ArrVal_9270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9272))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9268))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9270))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9269) .cse4 v_ArrVal_9271) .cse5 v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-28 20:45:16,314 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9268))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9269) .cse2 v_ArrVal_9271) (select (select (store .cse3 .cse2 v_ArrVal_9270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9272))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9268))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9270))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9269) .cse5 v_ArrVal_9271) .cse6 v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-28 20:45:22,823 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9364))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9268))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9270))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9365) .cse0 v_ArrVal_9269) .cse1 v_ArrVal_9271) .cse2 v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9364))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9268))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9365) .cse8 v_ArrVal_9269) .cse9 v_ArrVal_9271) (select (select (store .cse10 .cse9 v_ArrVal_9270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9272))))) |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:45:22,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:45:22,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401652741] [2023-11-28 20:45:22,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401652741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:45:22,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [470347913] [2023-11-28 20:45:22,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:45:22,864 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:45:22,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:45:22,865 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:45:22,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-28 20:46:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:46:00,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-28 20:46:00,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:46:00,208 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:03,244 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:46:03,244 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:03,298 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:46:03,768 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:03,905 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:05,311 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:05,339 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:10,601 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:46:10,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:10,685 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:11,934 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:46:11,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:12,018 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:12,885 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:46:12,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:12,969 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:13,802 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:46:13,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:13,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-28 20:46:13,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-28 20:46:14,021 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:14,049 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:14,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:46:14,276 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9868) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9868) |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:14,415 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9868) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9868) |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:14,646 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9866) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9868) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9867))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9866) .cse2 v_ArrVal_9868) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-28 20:46:15,000 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9866) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9868) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9867))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9866) .cse3 v_ArrVal_9868) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-28 20:46:15,426 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9864))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9867))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9865) .cse0 v_ArrVal_9866) .cse1 v_ArrVal_9868) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9864))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9865) .cse6 v_ArrVal_9866) (select (select (store .cse7 .cse6 v_ArrVal_9867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9868))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-28 20:46:16,322 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9864))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9867))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9865) .cse1 v_ArrVal_9866) .cse2 v_ArrVal_9868) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9864))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9865) .cse7 v_ArrVal_9866) (select (select (store .cse8 .cse7 v_ArrVal_9867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9868))) |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:24,796 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9961 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9960 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9961))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9864))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9960) .cse1 v_ArrVal_9865) .cse2 v_ArrVal_9866) (select (select (store .cse3 .cse2 v_ArrVal_9867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9868))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9868 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9961 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9960 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9961))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9864))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9867))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9960) .cse6 v_ArrVal_9865) .cse7 v_ArrVal_9866) .cse8 v_ArrVal_9868) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9869) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-28 20:46:24,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [470347913] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:46:24,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:46:24,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-28 20:46:24,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859236089] [2023-11-28 20:46:24,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:46:24,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:46:24,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:46:24,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:46:24,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=14, NotChecked=714, Total=1190 [2023-11-28 20:46:24,836 INFO L87 Difference]: Start difference. First operand 804 states and 944 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 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:47:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:47:41,544 INFO L93 Difference]: Finished difference Result 1084 states and 1330 transitions. [2023-11-28 20:47:41,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-28 20:47:41,545 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 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 114 [2023-11-28 20:47:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:47:41,550 INFO L225 Difference]: With dead ends: 1084 [2023-11-28 20:47:41,550 INFO L226 Difference]: Without dead ends: 1084 [2023-11-28 20:47:41,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=161, Invalid=637, Unknown=14, NotChecked=910, Total=1722 [2023-11-28 20:47:41,551 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 1051 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 4600 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 4621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:47:41,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 2098 Invalid, 4621 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 4600 Invalid, 0 Unknown, 0 Unchecked, 74.2s Time] [2023-11-28 20:47:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2023-11-28 20:47:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 803. [2023-11-28 20:47:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 533 states have (on average 1.7148217636022514) internal successors, (914), 795 states have internal predecessors, (914), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-28 20:47:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 943 transitions. [2023-11-28 20:47:41,565 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 943 transitions. Word has length 114 [2023-11-28 20:47:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:47:41,565 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 943 transitions. [2023-11-28 20:47:41,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 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:47:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 943 transitions. [2023-11-28 20:47:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-28 20:47:41,566 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:47:41,566 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:47:41,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-28 20:47:41,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:47:41,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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:41,967 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:47:41,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:47:41,967 INFO L85 PathProgramCache]: Analyzing trace with hash -695486701, now seen corresponding path program 1 times [2023-11-28 20:47:41,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:47:41,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919240197] [2023-11-28 20:47:41,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:47:41,968 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:41,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:47:41,969 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:41,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:47:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:47:43,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-28 20:47:43,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:47:43,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-28 20:47:45,299 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:47:45,299 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:45,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-28 20:47:46,369 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:53,511 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:47:53,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:47:54,509 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:47:54,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-28 20:47:55,238 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:47:55,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-28 20:47:55,998 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:47:55,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:47:56,757 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:47:56,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-28 20:47:56,886 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:47:57,438 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-28 20:47:57,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-28 20:47:57,834 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:47:57,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:47:59,336 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10436 (_ BitVec 1)) (v_ArrVal_10435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10435) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))))) is different from false [2023-11-28 20:47:59,452 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10436 (_ BitVec 1)) (v_ArrVal_10434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10434))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10435)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-28 20:47:59,567 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10436 (_ BitVec 1)) (v_ArrVal_10434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10434))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10435)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-28 20:47:59,691 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10436 (_ BitVec 1)) (v_ArrVal_10434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10433))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10434)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10435)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-28 20:47:59,812 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10436 (_ BitVec 1)) (v_ArrVal_10434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10433))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10434)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10435)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-28 20:47:59,937 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10436 (_ BitVec 1)) (v_ArrVal_10434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10432))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10433)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10434)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10435)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-28 20:48:00,069 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10436 (_ BitVec 1)) (v_ArrVal_10434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10432))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10433)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10434)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10435)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-28 20:48:02,133 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10436 (_ BitVec 1)) (v_ArrVal_10434 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10435 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10482))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10432)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10433)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10434)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10435)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-28 20:48:02,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:48:02,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919240197] [2023-11-28 20:48:02,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919240197] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:48:02,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [282095180] [2023-11-28 20:48:02,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:48:02,155 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:48:02,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:48:02,156 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:48:02,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-28 20:48:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:48:07,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-28 20:48:07,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:48:07,894 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:48:11,480 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:48:11,480 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:48:12,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-28 20:48:13,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-28 20:48:23,073 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:48:23,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:48:24,860 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:48:24,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:48:25,982 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:48:25,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:48:27,020 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:48:27,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:48:28,104 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:48:28,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 20:48:28,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-28 20:48:28,789 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-28 20:48:28,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-28 20:48:28,890 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:28,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:48:29,460 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10436 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10956 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10956) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-28 20:48:29,606 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10436 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10956 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))))) is different from false [2023-11-28 20:48:29,729 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10436 (_ BitVec 1)) (v_ArrVal_10955 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10956 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10955))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1)))) is different from false [2023-11-28 20:48:29,846 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10436 (_ BitVec 1)) (v_ArrVal_10955 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10956 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10955))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-28 20:48:29,968 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10436 (_ BitVec 1)) (v_ArrVal_10955 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10956 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10954))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10955)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-28 20:48:30,091 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10436 (_ BitVec 1)) (v_ArrVal_10955 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10956 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10954))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10955)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-28 20:48:30,220 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10436 (_ BitVec 1)) (v_ArrVal_10955 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10956 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10953))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10954)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10955)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-28 20:48:30,351 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10436 (_ BitVec 1)) (v_ArrVal_10955 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32)) (v_ArrVal_10956 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10436) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10953))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10954)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10955)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10956)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-28 20:48:33,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [282095180] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:48:33,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:48:33,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-28 20:48:33,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115550747] [2023-11-28 20:48:33,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:48:33,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-28 20:48:33,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:48:33,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-28 20:48:33,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=598, Unknown=19, NotChecked=1040, Total=1806 [2023-11-28 20:48:33,131 INFO L87 Difference]: Start difference. First operand 803 states and 943 transitions. Second operand has 23 states, 20 states have (on average 7.0) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:49:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:49:07,731 INFO L93 Difference]: Finished difference Result 1083 states and 1329 transitions. [2023-11-28 20:49:07,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-28 20:49:07,732 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.0) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 116 [2023-11-28 20:49:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:49:07,736 INFO L225 Difference]: With dead ends: 1083 [2023-11-28 20:49:07,736 INFO L226 Difference]: Without dead ends: 1083 [2023-11-28 20:49:07,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=158, Invalid=643, Unknown=19, NotChecked=1072, Total=1892 [2023-11-28 20:49:07,737 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 537 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:49:07,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1795 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 34.1s Time] [2023-11-28 20:49:07,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2023-11-28 20:49:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 802. [2023-11-28 20:49:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 533 states have (on average 1.7129455909943714) internal successors, (913), 794 states have internal predecessors, (913), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-28 20:49:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 942 transitions. [2023-11-28 20:49:07,749 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 942 transitions. Word has length 116 [2023-11-28 20:49:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:49:07,749 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 942 transitions. [2023-11-28 20:49:07,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.0) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 20:49:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 942 transitions. [2023-11-28 20:49:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-28 20:49:07,750 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:49:07,750 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:49:07,760 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:49:07,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-28 20:49:08,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 20:49:08,151 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 427 more)] === [2023-11-28 20:49:08,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:49:08,151 INFO L85 PathProgramCache]: Analyzing trace with hash -695486700, now seen corresponding path program 1 times [2023-11-28 20:49:08,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:49:08,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818517788] [2023-11-28 20:49:08,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:49:08,152 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:49:08,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:49:08,153 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:49:08,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:49:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:49:09,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 125 conjunts are in the unsatisfiable core [2023-11-28 20:49:09,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:49:09,673 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:49:11,168 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:49:11,523 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:49:11,523 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:49:11,918 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:49:12,016 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:49:13,219 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:49:13,252 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:49:24,319 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:49:24,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:49:24,447 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:49:25,483 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:49:25,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:49:25,518 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:49:26,505 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:49:26,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:49:26,540 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:49:27,475 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:49:27,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:49:27,600 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:49:28,501 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 20:49:28,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2023-11-28 20:49:28,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:49:28,744 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:49:28,779 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:49:28,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:49:28,828 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:49:29,155 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-28 20:49:29,155 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:49:29,465 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:49:29,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:49:34,080 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (bvadd (_ bv4 32) .cse2))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11528 (_ BitVec 32))) (bvule .cse0 (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11528) (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (bvule .cse2 .cse0) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))))) is different from false [2023-11-28 20:49:35,326 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11527 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11528 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11528) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_11527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))))))) is different from false [2023-11-28 20:49:35,556 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11525) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11527 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11528 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11524))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11525) .cse2 v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11528) (select (select (store .cse3 .cse2 v_ArrVal_11527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-28 20:49:35,810 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11527 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11528 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_11524))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_11525) .cse1 v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11528) (select (select (store .cse3 .cse1 v_ArrVal_11527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_11525) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd .cse4 (_ bv4 32))))))))) is different from false [2023-11-28 20:49:36,054 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11527 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11528 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11522))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_11524))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11523) .cse0 v_ArrVal_11525) .cse1 v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11528) (select (select (store .cse3 .cse1 v_ArrVal_11527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11522))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11523) .cse6 v_ArrVal_11525) (select (select (store .cse7 .cse6 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11526))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd .cse5 (_ bv4 32)))))))) is different from false [2023-11-28 20:49:36,283 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_11522))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_11523) .cse2 v_ArrVal_11525) (select (select (store .cse3 .cse2 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11526))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11527 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11528 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_11522))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_11524))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_11523) .cse5 v_ArrVal_11525) .cse6 v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11528) (select (select (store .cse7 .cse6 v_ArrVal_11527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-28 20:49:36,551 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11527 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11528 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11520))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11522))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11524))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11521) .cse0 v_ArrVal_11523) .cse1 v_ArrVal_11525) .cse2 v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11528) (select (select (store .cse4 .cse2 v_ArrVal_11527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11520))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11522))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11521) .cse8 v_ArrVal_11523) .cse9 v_ArrVal_11525) (select (select (store .cse10 .cse9 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11526))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd (_ bv4 32) .cse7))))))) is different from false [2023-11-28 20:49:36,793 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$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_11520))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_11522))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_11521) .cse2 v_ArrVal_11523) .cse3 v_ArrVal_11525) (select (select (store .cse4 .cse3 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11526))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11527 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11528 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_11520))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_11522))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11524))) (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$#3.offset| .cse1 v_ArrVal_11521) .cse7 v_ArrVal_11523) .cse8 v_ArrVal_11525) .cse9 v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11528) (select (select (store .cse10 .cse9 v_ArrVal_11527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-28 20:49:46,231 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11527 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11528 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11619))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_11520))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_11522))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_11524))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11620) .cse0 v_ArrVal_11521) .cse1 v_ArrVal_11523) .cse2 v_ArrVal_11525) .cse3 v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11528) (select (select (store .cse5 .cse3 v_ArrVal_11527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11619))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_11520))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_11522))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11620) .cse10 v_ArrVal_11521) .cse11 v_ArrVal_11523) .cse12 v_ArrVal_11525) (select (select (store .cse13 .cse12 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11526))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse9 (bvadd (_ bv4 32) .cse9))))))) is different from false [2023-11-28 20:49:46,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:49:46,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818517788] [2023-11-28 20:49:46,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818517788] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:49:46,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2136699781] [2023-11-28 20:49:46,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:49:46,292 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 20:49:46,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 20:49:46,293 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 20:49:46,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04472647-e8e4-4085-8059-94493721a3fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-28 20:49:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:49:55,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 126 conjunts are in the unsatisfiable core [2023-11-28 20:49:55,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:49:56,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:50:01,093 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:50:01,093 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:01,314 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:02,224 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:02,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:50:05,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2023-11-28 20:50:05,076 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:50:19,842 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:50:19,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-11-28 20:50:19,932 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:50:22,654 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:50:22,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-11-28 20:50:22,745 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:50:24,536 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:50:24,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-11-28 20:50:24,626 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:50:26,409 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:50:26,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:50:26,590 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:50:28,203 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 20:50:28,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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:50:28,378 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:50:28,568 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:50:28,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:50:28,637 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:28,684 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:50:29,105 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-28 20:50:29,105 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:29,150 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:29,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:50:33,037 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11527 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11528 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12142))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12141) .cse0 v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11528) (select (select (store .cse2 .cse0 v_ArrVal_11527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12141 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12141) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12142) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd .cse3 (_ bv4 32)))))))) is different from false [2023-11-28 20:50:33,356 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_12142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11527 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11528 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_12142))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_12141) .cse1 v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11528) (select (select (store .cse3 .cse1 v_ArrVal_11527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12141 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_12141) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_12142) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))))))) is different from false [2023-11-28 20:50:37,614 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11527 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11528 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12140))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_12142))) (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$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12139) .cse0 v_ArrVal_12141) .cse1 v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11528) (select (select (store .cse3 .cse1 v_ArrVal_11527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12141 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12140))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12139) .cse6 v_ArrVal_12141) (select (select (store .cse7 .cse6 v_ArrVal_12142) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11526))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv4 32) .cse5))))))) is different from false [2023-11-28 20:50:41,881 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_12142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11527 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11528 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_12140))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12142))) (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$#3.offset| .cse0 v_ArrVal_12139) .cse1 v_ArrVal_12141) .cse2 v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11528) (select (select (store .cse4 .cse2 v_ArrVal_11527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((v_ArrVal_12142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12141 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_12140))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_12139) .cse7 v_ArrVal_12141) (select (select (store .cse8 .cse7 v_ArrVal_12142) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11526))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse6 (bvadd (_ bv4 32) .cse6)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-28 20:50:42,383 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_12142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12141 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12138))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_12140))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12137) .cse1 v_ArrVal_12139) .cse2 v_ArrVal_12141) (select (select (store .cse3 .cse2 v_ArrVal_12142) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11526))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_12142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11527 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11528 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12138))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_12140))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_12142))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12137) .cse6 v_ArrVal_12139) .cse7 v_ArrVal_12141) .cse8 v_ArrVal_11526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11528) (select (select (store .cse9 .cse8 v_ArrVal_11527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false