./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/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_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/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_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/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 1fe25077175322d8d5e3cefee67a534dcd61077607911040f354db1679589b09 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:51:31,105 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:51:31,165 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-28 23:51:31,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:51:31,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:51:31,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:51:31,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:51:31,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:51:31,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:51:31,193 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:51:31,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:51:31,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:51:31,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:51:31,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:51:31,196 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:51:31,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:51:31,197 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:51:31,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:51:31,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:51:31,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:51:31,199 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:51:31,201 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:51:31,201 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:51:31,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:51:31,202 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:51:31,202 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:51:31,202 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:51:31,203 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:51:31,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:51:31,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:51:31,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:51:31,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:51:31,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:51:31,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:51:31,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:51:31,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:51:31,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:51:31,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:51:31,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:51:31,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:51:31,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:51:31,213 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_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/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_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/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 -> 1fe25077175322d8d5e3cefee67a534dcd61077607911040f354db1679589b09 [2023-11-28 23:51:31,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:51:31,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:51:31,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:51:31,456 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:51:31,457 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:51:31,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i [2023-11-28 23:51:34,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:51:34,491 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:51:34,492 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i [2023-11-28 23:51:34,511 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/data/e4f3ea8db/29e807d6b613465d8c7ce75116aded04/FLAG82c66bc7a [2023-11-28 23:51:34,525 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/data/e4f3ea8db/29e807d6b613465d8c7ce75116aded04 [2023-11-28 23:51:34,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:51:34,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:51:34,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:51:34,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:51:34,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:51:34,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:51:34" (1/1) ... [2023-11-28 23:51:34,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce94b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:34, skipping insertion in model container [2023-11-28 23:51:34,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:51:34" (1/1) ... [2023-11-28 23:51:34,611 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:51:35,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:51:35,184 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 23:51:35,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3cfb7e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:35, skipping insertion in model container [2023-11-28 23:51:35,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:51:35,185 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-28 23:51:35,187 INFO L158 Benchmark]: Toolchain (without parser) took 656.84ms. Allocated memory is still 138.4MB. Free memory was 91.5MB in the beginning and 68.0MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-28 23:51:35,188 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 138.4MB. Free memory was 107.5MB in the beginning and 107.4MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:51:35,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 654.44ms. Allocated memory is still 138.4MB. Free memory was 91.5MB in the beginning and 68.0MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-28 23:51:35,190 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.25ms. Allocated memory is still 138.4MB. Free memory was 107.5MB in the beginning and 107.4MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 654.44ms. Allocated memory is still 138.4MB. Free memory was 91.5MB in the beginning and 68.0MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/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_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/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_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/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 1fe25077175322d8d5e3cefee67a534dcd61077607911040f354db1679589b09 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:51:36,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:51:37,052 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-28 23:51:37,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:51:37,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:51:37,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:51:37,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:51:37,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:51:37,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:51:37,095 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:51:37,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:51:37,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:51:37,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:51:37,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:51:37,098 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:51:37,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:51:37,099 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:51:37,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:51:37,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:51:37,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:51:37,102 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:51:37,102 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:51:37,103 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:51:37,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:51:37,104 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:51:37,104 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 23:51:37,105 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 23:51:37,105 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:51:37,105 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:51:37,106 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:51:37,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:51:37,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:51:37,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:51:37,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:51:37,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:51:37,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:51:37,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:51:37,108 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 23:51:37,108 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 23:51:37,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:51:37,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:51:37,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:51:37,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:51:37,110 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 23:51:37,110 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_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/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_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/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 -> 1fe25077175322d8d5e3cefee67a534dcd61077607911040f354db1679589b09 [2023-11-28 23:51:37,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:51:37,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:51:37,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:51:37,415 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:51:37,415 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:51:37,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i [2023-11-28 23:51:40,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:51:40,431 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:51:40,432 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-2.i [2023-11-28 23:51:40,449 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/data/57c4d0257/f71b54ed870740608b05ef4d3c374d71/FLAG739b3ce48 [2023-11-28 23:51:40,460 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/data/57c4d0257/f71b54ed870740608b05ef4d3c374d71 [2023-11-28 23:51:40,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:51:40,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:51:40,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:51:40,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:51:40,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:51:40,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:51:40" (1/1) ... [2023-11-28 23:51:40,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0d2257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:40, skipping insertion in model container [2023-11-28 23:51:40,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:51:40" (1/1) ... [2023-11-28 23:51:40,550 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:51:41,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:51:41,136 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-28 23:51:41,151 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:51:41,245 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:51:41,249 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:51:41,324 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:51:41,358 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:51:41,366 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:51:41,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:41 WrapperNode [2023-11-28 23:51:41,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:51:41,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:51:41,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:51:41,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:51:41,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:41" (1/1) ... [2023-11-28 23:51:41,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:41" (1/1) ... [2023-11-28 23:51:41,480 INFO L138 Inliner]: procedures = 180, calls = 441, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1585 [2023-11-28 23:51:41,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:51:41,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:51:41,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:51:41,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:51:41,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:41" (1/1) ... [2023-11-28 23:51:41,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:41" (1/1) ... [2023-11-28 23:51:41,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:41" (1/1) ... [2023-11-28 23:51:41,624 INFO L175 MemorySlicer]: Split 407 memory accesses to 5 slices as follows [2, 371, 5, 5, 24]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 93 writes are split as follows [0, 90, 1, 1, 1]. [2023-11-28 23:51:41,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:41" (1/1) ... [2023-11-28 23:51:41,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:41" (1/1) ... [2023-11-28 23:51:41,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:41" (1/1) ... [2023-11-28 23:51:41,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:41" (1/1) ... [2023-11-28 23:51:41,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:41" (1/1) ... [2023-11-28 23:51:41,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:41" (1/1) ... [2023-11-28 23:51:41,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:51:41,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:51:41,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:51:41,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:51:41,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:41" (1/1) ... [2023-11-28 23:51:41,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:51:41,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:51:41,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:51:41,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:51:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-28 23:51:41,793 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-28 23:51:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-28 23:51:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-28 23:51:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-28 23:51:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-28 23:51:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-28 23:51:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-28 23:51:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-28 23:51:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-28 23:51:41,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-28 23:51:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-28 23:51:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-28 23:51:41,795 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-28 23:51:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-28 23:51:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-28 23:51:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-28 23:51:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-28 23:51:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2023-11-28 23:51:41,796 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-28 23:51:41,796 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-28 23:51:41,796 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-28 23:51:41,796 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-28 23:51:41,796 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2023-11-28 23:51:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-28 23:51:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:51:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-28 23:51:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-28 23:51:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-28 23:51:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-28 23:51:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-28 23:51:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:51:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-28 23:51:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-28 23:51:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-28 23:51:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-28 23:51:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-28 23:51:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-28 23:51:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:51:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-28 23:51:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-28 23:51:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-28 23:51:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-28 23:51:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-28 23:51:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 23:51:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-28 23:51:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-28 23:51:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-28 23:51:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-28 23:51:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:51:41,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:51:42,052 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:51:42,054 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:51:42,080 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 23:51:42,114 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 23:51:42,141 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 23:51:42,164 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 23:51:42,193 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-28 23:51:48,916 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:51:49,171 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:51:49,172 INFO L309 CfgBuilder]: Removed 92 assume(true) statements. [2023-11-28 23:51:49,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:51:49 BoogieIcfgContainer [2023-11-28 23:51:49,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:51:49,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:51:49,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:51:49,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:51:49,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:51:40" (1/3) ... [2023-11-28 23:51:49,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38463847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:51:49, skipping insertion in model container [2023-11-28 23:51:49,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:51:41" (2/3) ... [2023-11-28 23:51:49,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38463847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:51:49, skipping insertion in model container [2023-11-28 23:51:49,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:51:49" (3/3) ... [2023-11-28 23:51:49,181 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-2.i [2023-11-28 23:51:49,198 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:51:49,198 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 833 error locations. [2023-11-28 23:51:49,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:51:49,275 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;@24d39202, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:51:49,275 INFO L358 AbstractCegarLoop]: Starting to check reachability of 833 error locations. [2023-11-28 23:51:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 1507 states, 663 states have (on average 2.5279034690799396) internal successors, (1676), 1497 states have internal predecessors, (1676), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-28 23:51:49,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-28 23:51:49,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:51:49,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-28 23:51:49,291 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:51:49,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:51:49,297 INFO L85 PathProgramCache]: Analyzing trace with hash 79665205, now seen corresponding path program 1 times [2023-11-28 23:51:49,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:51:49,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902510257] [2023-11-28 23:51:49,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:51:49,309 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 23:51:49,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:51:49,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:51:49,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:51:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:49,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-28 23:51:49,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:51:49,536 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 23:51:49,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:51:49,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:51:49,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902510257] [2023-11-28 23:51:49,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902510257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:51:49,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:51:49,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:51:49,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025925524] [2023-11-28 23:51:49,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:51:49,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 23:51:49,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:51:49,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 23:51:49,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 23:51:49,570 INFO L87 Difference]: Start difference. First operand has 1507 states, 663 states have (on average 2.5279034690799396) internal successors, (1676), 1497 states have internal predecessors, (1676), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:51:50,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:51:50,608 INFO L93 Difference]: Finished difference Result 1487 states and 1580 transitions. [2023-11-28 23:51:50,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 23:51:50,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-28 23:51:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:51:50,629 INFO L225 Difference]: With dead ends: 1487 [2023-11-28 23:51:50,629 INFO L226 Difference]: Without dead ends: 1486 [2023-11-28 23:51:50,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 23:51:50,635 INFO L413 NwaCegarLoop]: 1418 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-28 23:51:50,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1418 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-28 23:51:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2023-11-28 23:51:50,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2023-11-28 23:51:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 654 states have (on average 2.3776758409785934) internal successors, (1555), 1476 states have internal predecessors, (1555), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-28 23:51:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1579 transitions. [2023-11-28 23:51:50,726 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1579 transitions. Word has length 4 [2023-11-28 23:51:50,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:51:50,726 INFO L495 AbstractCegarLoop]: Abstraction has 1486 states and 1579 transitions. [2023-11-28 23:51:50,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:51:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1579 transitions. [2023-11-28 23:51:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-28 23:51:50,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:51:50,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-28 23:51:50,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:51:50,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:51:50,928 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:51:50,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:51:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash 79665267, now seen corresponding path program 1 times [2023-11-28 23:51:50,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:51:50,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439093738] [2023-11-28 23:51:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:51:50,930 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 23:51:50,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:51:50,931 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:51:50,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:51:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:51,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:51:51,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:51:51,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-28 23:51:51,119 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 23:51:51,119 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:51:51,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:51:51,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439093738] [2023-11-28 23:51:51,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439093738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:51:51,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:51:51,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:51:51,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685901760] [2023-11-28 23:51:51,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:51:51,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:51:51,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:51:51,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:51:51,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:51:51,123 INFO L87 Difference]: Start difference. First operand 1486 states and 1579 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:51:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:51:54,439 INFO L93 Difference]: Finished difference Result 1715 states and 1852 transitions. [2023-11-28 23:51:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:51:54,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-28 23:51:54,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:51:54,448 INFO L225 Difference]: With dead ends: 1715 [2023-11-28 23:51:54,448 INFO L226 Difference]: Without dead ends: 1715 [2023-11-28 23:51:54,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:51:54,449 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 1235 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:51:54,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1279 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-28 23:51:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2023-11-28 23:51:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1461. [2023-11-28 23:51:54,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 720 states have (on average 2.2069444444444444) internal successors, (1589), 1451 states have internal predecessors, (1589), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-28 23:51:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1613 transitions. [2023-11-28 23:51:54,487 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1613 transitions. Word has length 4 [2023-11-28 23:51:54,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:51:54,487 INFO L495 AbstractCegarLoop]: Abstraction has 1461 states and 1613 transitions. [2023-11-28 23:51:54,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:51:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1613 transitions. [2023-11-28 23:51:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-28 23:51:54,487 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:51:54,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-28 23:51:54,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-28 23:51:54,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:51:54,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:51:54,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:51:54,689 INFO L85 PathProgramCache]: Analyzing trace with hash 79665268, now seen corresponding path program 1 times [2023-11-28 23:51:54,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:51:54,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377245309] [2023-11-28 23:51:54,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:51:54,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 23:51:54,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:51:54,691 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:51:54,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:51:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:51:54,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:51:54,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:51:54,821 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 23:51:54,845 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 23:51:54,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:51:54,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:51:54,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377245309] [2023-11-28 23:51:54,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377245309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:51:54,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:51:54,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:51:54,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114578494] [2023-11-28 23:51:54,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:51:54,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:51:54,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:51:54,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:51:54,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:51:54,848 INFO L87 Difference]: Start difference. First operand 1461 states and 1613 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:51:59,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:51:59,722 INFO L93 Difference]: Finished difference Result 1930 states and 2133 transitions. [2023-11-28 23:51:59,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:51:59,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-28 23:51:59,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:51:59,733 INFO L225 Difference]: With dead ends: 1930 [2023-11-28 23:51:59,733 INFO L226 Difference]: Without dead ends: 1930 [2023-11-28 23:51:59,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:51:59,734 INFO L413 NwaCegarLoop]: 1285 mSDtfsCounter, 673 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-28 23:51:59,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1864 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-11-28 23:51:59,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2023-11-28 23:51:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1584. [2023-11-28 23:51:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 853 states have (on average 2.182883939038687) internal successors, (1862), 1574 states have internal predecessors, (1862), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-28 23:51:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 1886 transitions. [2023-11-28 23:51:59,781 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 1886 transitions. Word has length 4 [2023-11-28 23:51:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:51:59,781 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 1886 transitions. [2023-11-28 23:51:59,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:51:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 1886 transitions. [2023-11-28 23:51:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-28 23:51:59,781 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:51:59,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:51:59,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:51:59,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:51:59,982 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:51:59,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:51:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1823652708, now seen corresponding path program 1 times [2023-11-28 23:51:59,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:51:59,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367250043] [2023-11-28 23:51:59,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:51:59,983 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 23:51:59,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:51:59,984 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:51:59,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:00,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 23:52:00,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:00,120 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 23:52:00,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:00,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:00,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367250043] [2023-11-28 23:52:00,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367250043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:00,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:00,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:52:00,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871037065] [2023-11-28 23:52:00,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:00,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:52:00,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:00,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:52:00,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:00,123 INFO L87 Difference]: Start difference. First operand 1584 states and 1886 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:01,992 INFO L93 Difference]: Finished difference Result 2969 states and 3562 transitions. [2023-11-28 23:52:01,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:52:01,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-28 23:52:01,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:02,009 INFO L225 Difference]: With dead ends: 2969 [2023-11-28 23:52:02,009 INFO L226 Difference]: Without dead ends: 2969 [2023-11-28 23:52:02,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:02,011 INFO L413 NwaCegarLoop]: 1495 mSDtfsCounter, 1243 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:02,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 2802 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-28 23:52:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2023-11-28 23:52:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1586. [2023-11-28 23:52:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 855 states have (on average 2.1801169590643275) internal successors, (1864), 1576 states have internal predecessors, (1864), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-28 23:52:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 1888 transitions. [2023-11-28 23:52:02,057 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 1888 transitions. Word has length 5 [2023-11-28 23:52:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:02,058 INFO L495 AbstractCegarLoop]: Abstraction has 1586 states and 1888 transitions. [2023-11-28 23:52:02,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1888 transitions. [2023-11-28 23:52:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-28 23:52:02,059 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:02,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:02,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:02,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:52:02,262 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:52:02,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:02,262 INFO L85 PathProgramCache]: Analyzing trace with hash -32935171, now seen corresponding path program 1 times [2023-11-28 23:52:02,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:52:02,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941937748] [2023-11-28 23:52:02,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:02,263 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 23:52:02,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:52:02,264 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:02,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:02,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 23:52:02,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:02,432 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 23:52:02,432 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:02,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:02,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941937748] [2023-11-28 23:52:02,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941937748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:02,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:02,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:52:02,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308729415] [2023-11-28 23:52:02,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:02,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:52:02,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:02,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:52:02,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:02,434 INFO L87 Difference]: Start difference. First operand 1586 states and 1888 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:03,504 INFO L93 Difference]: Finished difference Result 1547 states and 1848 transitions. [2023-11-28 23:52:03,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:52:03,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-28 23:52:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:03,512 INFO L225 Difference]: With dead ends: 1547 [2023-11-28 23:52:03,512 INFO L226 Difference]: Without dead ends: 1547 [2023-11-28 23:52:03,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:03,513 INFO L413 NwaCegarLoop]: 1268 mSDtfsCounter, 70 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:03,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2487 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-28 23:52:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2023-11-28 23:52:03,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1547. [2023-11-28 23:52:03,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 840 states have (on average 2.1714285714285713) internal successors, (1824), 1537 states have internal predecessors, (1824), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-28 23:52:03,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 1848 transitions. [2023-11-28 23:52:03,538 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 1848 transitions. Word has length 10 [2023-11-28 23:52:03,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:03,538 INFO L495 AbstractCegarLoop]: Abstraction has 1547 states and 1848 transitions. [2023-11-28 23:52:03,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:03,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1848 transitions. [2023-11-28 23:52:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-28 23:52:03,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:03,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:03,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:03,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:52:03,742 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:52:03,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:03,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1585930985, now seen corresponding path program 1 times [2023-11-28 23:52:03,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:52:03,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602651521] [2023-11-28 23:52:03,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:03,743 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 23:52:03,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:52:03,744 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:03,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:03,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:52:03,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:03,950 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 23:52:03,951 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:03,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:03,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602651521] [2023-11-28 23:52:03,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602651521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:03,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:03,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:52:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437200363] [2023-11-28 23:52:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:03,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:52:03,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:03,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:52:03,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:52:03,952 INFO L87 Difference]: Start difference. First operand 1547 states and 1848 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:05,384 INFO L93 Difference]: Finished difference Result 1533 states and 1827 transitions. [2023-11-28 23:52:05,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:52:05,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-28 23:52:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:05,392 INFO L225 Difference]: With dead ends: 1533 [2023-11-28 23:52:05,392 INFO L226 Difference]: Without dead ends: 1533 [2023-11-28 23:52:05,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:52:05,393 INFO L413 NwaCegarLoop]: 1237 mSDtfsCounter, 58 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3687 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:05,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3687 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-28 23:52:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2023-11-28 23:52:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1532. [2023-11-28 23:52:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 839 states have (on average 2.1477949940405243) internal successors, (1802), 1522 states have internal predecessors, (1802), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-28 23:52:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1826 transitions. [2023-11-28 23:52:05,417 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1826 transitions. Word has length 12 [2023-11-28 23:52:05,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:05,417 INFO L495 AbstractCegarLoop]: Abstraction has 1532 states and 1826 transitions. [2023-11-28 23:52:05,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1826 transitions. [2023-11-28 23:52:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-28 23:52:05,418 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:05,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:05,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:05,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:52:05,619 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:52:05,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:05,620 INFO L85 PathProgramCache]: Analyzing trace with hash -993697339, now seen corresponding path program 1 times [2023-11-28 23:52:05,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:52:05,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715375109] [2023-11-28 23:52:05,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:05,620 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 23:52:05,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:52:05,621 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:05,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:05,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:52:05,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:05,785 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 23:52:05,850 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 23:52:05,851 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:05,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715375109] [2023-11-28 23:52:05,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715375109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:05,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:05,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:52:05,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745410091] [2023-11-28 23:52:05,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:05,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:52:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:05,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:52:05,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:52:05,853 INFO L87 Difference]: Start difference. First operand 1532 states and 1826 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:09,400 INFO L93 Difference]: Finished difference Result 1783 states and 2062 transitions. [2023-11-28 23:52:09,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:52:09,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-28 23:52:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:09,407 INFO L225 Difference]: With dead ends: 1783 [2023-11-28 23:52:09,407 INFO L226 Difference]: Without dead ends: 1783 [2023-11-28 23:52:09,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:52:09,408 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 1170 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:09,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1604 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-28 23:52:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2023-11-28 23:52:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1528. [2023-11-28 23:52:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 839 states have (on average 2.143027413587604) internal successors, (1798), 1518 states have internal predecessors, (1798), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-28 23:52:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1822 transitions. [2023-11-28 23:52:09,432 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1822 transitions. Word has length 26 [2023-11-28 23:52:09,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:09,433 INFO L495 AbstractCegarLoop]: Abstraction has 1528 states and 1822 transitions. [2023-11-28 23:52:09,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:09,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1822 transitions. [2023-11-28 23:52:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-28 23:52:09,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:09,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:09,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:09,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:52:09,643 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:52:09,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash -993697338, now seen corresponding path program 1 times [2023-11-28 23:52:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:52:09,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942803770] [2023-11-28 23:52:09,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:09,644 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 23:52:09,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:52:09,645 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:09,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:09,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 23:52:09,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:09,794 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 23:52:09,948 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 23:52:09,948 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:09,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:09,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942803770] [2023-11-28 23:52:09,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942803770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:09,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:09,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:52:09,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399159705] [2023-11-28 23:52:09,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:09,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:52:09,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:09,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:52:09,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:52:09,950 INFO L87 Difference]: Start difference. First operand 1528 states and 1822 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:15,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:15,598 INFO L93 Difference]: Finished difference Result 1871 states and 2066 transitions. [2023-11-28 23:52:15,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:52:15,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-28 23:52:15,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:15,607 INFO L225 Difference]: With dead ends: 1871 [2023-11-28 23:52:15,607 INFO L226 Difference]: Without dead ends: 1871 [2023-11-28 23:52:15,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:52:15,608 INFO L413 NwaCegarLoop]: 1043 mSDtfsCounter, 610 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:15,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 2215 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1873 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2023-11-28 23:52:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2023-11-28 23:52:15,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1524. [2023-11-28 23:52:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 839 states have (on average 2.138259833134684) internal successors, (1794), 1514 states have internal predecessors, (1794), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-28 23:52:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1818 transitions. [2023-11-28 23:52:15,631 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1818 transitions. Word has length 26 [2023-11-28 23:52:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:15,632 INFO L495 AbstractCegarLoop]: Abstraction has 1524 states and 1818 transitions. [2023-11-28 23:52:15,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1818 transitions. [2023-11-28 23:52:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-28 23:52:15,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:15,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:15,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:15,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:52:15,834 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:52:15,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:15,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1872897729, now seen corresponding path program 1 times [2023-11-28 23:52:15,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:52:15,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963773631] [2023-11-28 23:52:15,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:15,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:52:15,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:52:15,836 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:15,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:16,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:52:16,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:16,079 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 23:52:16,079 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:16,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:16,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963773631] [2023-11-28 23:52:16,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963773631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:16,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:16,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:52:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068586436] [2023-11-28 23:52:16,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:16,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:52:16,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:16,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:52:16,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:52:16,081 INFO L87 Difference]: Start difference. First operand 1524 states and 1818 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:17,411 INFO L93 Difference]: Finished difference Result 1518 states and 1808 transitions. [2023-11-28 23:52:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:52:17,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-11-28 23:52:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:17,418 INFO L225 Difference]: With dead ends: 1518 [2023-11-28 23:52:17,418 INFO L226 Difference]: Without dead ends: 1518 [2023-11-28 23:52:17,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:52:17,419 INFO L413 NwaCegarLoop]: 1231 mSDtfsCounter, 23 mSDsluCounter, 2442 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3673 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:17,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3673 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-28 23:52:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2023-11-28 23:52:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1518. [2023-11-28 23:52:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 833 states have (on average 2.141656662665066) internal successors, (1784), 1508 states have internal predecessors, (1784), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-28 23:52:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1808 transitions. [2023-11-28 23:52:17,445 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1808 transitions. Word has length 42 [2023-11-28 23:52:17,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:17,446 INFO L495 AbstractCegarLoop]: Abstraction has 1518 states and 1808 transitions. [2023-11-28 23:52:17,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1808 transitions. [2023-11-28 23:52:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-28 23:52:17,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:17,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:17,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:17,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:52:17,650 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:52:17,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:17,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1062926561, now seen corresponding path program 1 times [2023-11-28 23:52:17,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:52:17,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368785702] [2023-11-28 23:52:17,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:17,651 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 23:52:17,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:52:17,652 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:17,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:17,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:52:17,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:18,082 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 23:52:18,082 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:18,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:18,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368785702] [2023-11-28 23:52:18,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368785702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:18,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:18,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:52:18,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998261460] [2023-11-28 23:52:18,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:18,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:52:18,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:18,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:52:18,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:18,085 INFO L87 Difference]: Start difference. First operand 1518 states and 1808 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:19,415 INFO L93 Difference]: Finished difference Result 1741 states and 2040 transitions. [2023-11-28 23:52:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:52:19,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-11-28 23:52:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:19,425 INFO L225 Difference]: With dead ends: 1741 [2023-11-28 23:52:19,425 INFO L226 Difference]: Without dead ends: 1741 [2023-11-28 23:52:19,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:52:19,426 INFO L413 NwaCegarLoop]: 1298 mSDtfsCounter, 246 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:19,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 2430 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-28 23:52:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2023-11-28 23:52:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1561. [2023-11-28 23:52:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 876 states have (on average 2.085616438356164) internal successors, (1827), 1551 states have internal predecessors, (1827), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-28 23:52:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1851 transitions. [2023-11-28 23:52:19,447 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1851 transitions. Word has length 46 [2023-11-28 23:52:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:19,447 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 1851 transitions. [2023-11-28 23:52:19,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1851 transitions. [2023-11-28 23:52:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-28 23:52:19,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:19,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:19,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-28 23:52:19,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:52:19,649 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:52:19,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:19,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1041257572, now seen corresponding path program 1 times [2023-11-28 23:52:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:52:19,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438155307] [2023-11-28 23:52:19,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:19,650 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 23:52:19,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:52:19,651 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:19,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:19,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 23:52:19,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:19,953 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 23:52:19,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-28 23:52:20,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:52:20,395 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 23:52:20,411 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:52:20,411 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 23:52:20,427 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 23:52:20,427 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:20,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:20,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438155307] [2023-11-28 23:52:20,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438155307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:20,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:20,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:52:20,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530999141] [2023-11-28 23:52:20,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:20,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:52:20,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:20,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:52:20,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:52:20,429 INFO L87 Difference]: Start difference. First operand 1561 states and 1851 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:24,630 INFO L93 Difference]: Finished difference Result 1731 states and 2006 transitions. [2023-11-28 23:52:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:52:24,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-11-28 23:52:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:24,639 INFO L225 Difference]: With dead ends: 1731 [2023-11-28 23:52:24,639 INFO L226 Difference]: Without dead ends: 1731 [2023-11-28 23:52:24,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:52:24,640 INFO L413 NwaCegarLoop]: 468 mSDtfsCounter, 1377 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:24,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 761 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-28 23:52:24,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2023-11-28 23:52:24,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1344. [2023-11-28 23:52:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 743 states have (on average 1.9636608344549125) internal successors, (1459), 1334 states have internal predecessors, (1459), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-28 23:52:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1483 transitions. [2023-11-28 23:52:24,662 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1483 transitions. Word has length 49 [2023-11-28 23:52:24,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:24,663 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 1483 transitions. [2023-11-28 23:52:24,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1483 transitions. [2023-11-28 23:52:24,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-28 23:52:24,664 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:24,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:24,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:24,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:52:24,864 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:52:24,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:24,865 INFO L85 PathProgramCache]: Analyzing trace with hash -591425836, now seen corresponding path program 1 times [2023-11-28 23:52:24,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:52:24,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750929457] [2023-11-28 23:52:24,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:24,866 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 23:52:24,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:52:24,867 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:24,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:25,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 23:52:25,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:25,110 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 23:52:25,126 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 23:52:25,144 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 23:52:25,152 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 23:52:25,152 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:25,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:25,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750929457] [2023-11-28 23:52:25,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750929457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:25,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:25,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:52:25,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723394284] [2023-11-28 23:52:25,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:25,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:52:25,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:25,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:52:25,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:52:25,154 INFO L87 Difference]: Start difference. First operand 1344 states and 1483 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:29,322 INFO L93 Difference]: Finished difference Result 1343 states and 1482 transitions. [2023-11-28 23:52:29,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:52:29,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-11-28 23:52:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:29,328 INFO L225 Difference]: With dead ends: 1343 [2023-11-28 23:52:29,329 INFO L226 Difference]: Without dead ends: 1343 [2023-11-28 23:52:29,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:52:29,329 INFO L413 NwaCegarLoop]: 1159 mSDtfsCounter, 3 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 2237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3006 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:29,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3006 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2237 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-28 23:52:29,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2023-11-28 23:52:29,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1343. [2023-11-28 23:52:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 743 states have (on average 1.9623149394347241) internal successors, (1458), 1333 states have internal predecessors, (1458), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-28 23:52:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1482 transitions. [2023-11-28 23:52:29,359 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1482 transitions. Word has length 53 [2023-11-28 23:52:29,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:29,359 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1482 transitions. [2023-11-28 23:52:29,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1482 transitions. [2023-11-28 23:52:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-28 23:52:29,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:29,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:29,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:29,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:52:29,561 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:52:29,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash -591425835, now seen corresponding path program 1 times [2023-11-28 23:52:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:52:29,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969554377] [2023-11-28 23:52:29,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:29,562 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 23:52:29,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:52:29,563 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:29,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:29,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-28 23:52:29,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:29,801 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 23:52:29,821 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 23:52:29,826 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 23:52:29,862 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 23:52:29,880 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 23:52:29,880 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:29,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:29,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969554377] [2023-11-28 23:52:29,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969554377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:29,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:52:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606951921] [2023-11-28 23:52:29,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:29,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:52:29,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:29,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:52:29,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:52:29,882 INFO L87 Difference]: Start difference. First operand 1343 states and 1482 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:35,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:35,207 INFO L93 Difference]: Finished difference Result 1342 states and 1481 transitions. [2023-11-28 23:52:35,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:52:35,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-11-28 23:52:35,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:35,213 INFO L225 Difference]: With dead ends: 1342 [2023-11-28 23:52:35,213 INFO L226 Difference]: Without dead ends: 1342 [2023-11-28 23:52:35,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:52:35,213 INFO L413 NwaCegarLoop]: 1159 mSDtfsCounter, 1 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:35,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3050 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2191 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-11-28 23:52:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2023-11-28 23:52:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2023-11-28 23:52:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 742 states have (on average 1.963611859838275) internal successors, (1457), 1332 states have internal predecessors, (1457), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-28 23:52:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1481 transitions. [2023-11-28 23:52:35,234 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1481 transitions. Word has length 53 [2023-11-28 23:52:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:35,234 INFO L495 AbstractCegarLoop]: Abstraction has 1342 states and 1481 transitions. [2023-11-28 23:52:35,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:52:35,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1481 transitions. [2023-11-28 23:52:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-28 23:52:35,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:35,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:35,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:35,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:52:35,436 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:52:35,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1485722296, now seen corresponding path program 1 times [2023-11-28 23:52:35,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:52:35,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557130297] [2023-11-28 23:52:35,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:35,437 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 23:52:35,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:52:35,438 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:35,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:35,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:52:35,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:35,707 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 23:52:35,707 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:52:35,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:35,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557130297] [2023-11-28 23:52:35,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557130297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:52:35,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:52:35,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:52:35,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133588687] [2023-11-28 23:52:35,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:52:35,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:52:35,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:35,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:52:35,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:52:35,710 INFO L87 Difference]: Start difference. First operand 1342 states and 1481 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 23:52:37,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:37,127 INFO L93 Difference]: Finished difference Result 1344 states and 1485 transitions. [2023-11-28 23:52:37,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:52:37,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-11-28 23:52:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:37,135 INFO L225 Difference]: With dead ends: 1344 [2023-11-28 23:52:37,135 INFO L226 Difference]: Without dead ends: 1344 [2023-11-28 23:52:37,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:52:37,136 INFO L413 NwaCegarLoop]: 1158 mSDtfsCounter, 1 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:37,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3468 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-28 23:52:37,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2023-11-28 23:52:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1344. [2023-11-28 23:52:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 743 states have (on average 1.9636608344549125) internal successors, (1459), 1334 states have internal predecessors, (1459), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-28 23:52:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1485 transitions. [2023-11-28 23:52:37,156 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1485 transitions. Word has length 59 [2023-11-28 23:52:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:37,156 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 1485 transitions. [2023-11-28 23:52:37,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 23:52:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1485 transitions. [2023-11-28 23:52:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-28 23:52:37,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:37,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:37,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:37,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:52:37,357 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:52:37,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:37,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1492399711, now seen corresponding path program 1 times [2023-11-28 23:52:37,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:52:37,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385655837] [2023-11-28 23:52:37,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:52:37,358 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 23:52:37,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:52:37,359 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:37,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:52:37,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:52:37,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:37,670 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 23:52:37,670 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:52:37,736 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 23:52:37,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:37,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385655837] [2023-11-28 23:52:37,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385655837] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:52:37,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:52:37,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-28 23:52:37,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589072184] [2023-11-28 23:52:37,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:52:37,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 23:52:37,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:37,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 23:52:37,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 23:52:37,739 INFO L87 Difference]: Start difference. First operand 1344 states and 1485 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 23:52:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:39,951 INFO L93 Difference]: Finished difference Result 1353 states and 1500 transitions. [2023-11-28 23:52:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 23:52:39,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2023-11-28 23:52:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:39,960 INFO L225 Difference]: With dead ends: 1353 [2023-11-28 23:52:39,960 INFO L226 Difference]: Without dead ends: 1353 [2023-11-28 23:52:39,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 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 23:52:39,961 INFO L413 NwaCegarLoop]: 1156 mSDtfsCounter, 6 mSDsluCounter, 4610 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5766 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:39,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5766 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-28 23:52:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2023-11-28 23:52:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1352. [2023-11-28 23:52:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 750 states have (on average 1.9626666666666666) internal successors, (1472), 1341 states have internal predecessors, (1472), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-28 23:52:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1498 transitions. [2023-11-28 23:52:39,979 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1498 transitions. Word has length 60 [2023-11-28 23:52:39,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:39,979 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1498 transitions. [2023-11-28 23:52:39,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 23:52:39,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1498 transitions. [2023-11-28 23:52:39,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-28 23:52:39,980 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:39,980 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:39,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:40,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:52:40,180 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:52:40,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:40,181 INFO L85 PathProgramCache]: Analyzing trace with hash 884835448, now seen corresponding path program 2 times [2023-11-28 23:52:40,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:52:40,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109188562] [2023-11-28 23:52:40,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:52:40,181 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 23:52:40,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:52:40,182 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:40,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:40,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 23:52:40,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:52:40,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-28 23:52:40,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:40,669 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 23:52:40,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:52:40,801 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 23:52:40,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:40,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109188562] [2023-11-28 23:52:40,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109188562] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:52:40,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:52:40,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-28 23:52:40,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131161868] [2023-11-28 23:52:40,802 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:52:40,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 23:52:40,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:40,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 23:52:40,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-28 23:52:40,804 INFO L87 Difference]: Start difference. First operand 1352 states and 1498 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 23:52:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:43,846 INFO L93 Difference]: Finished difference Result 1367 states and 1524 transitions. [2023-11-28 23:52:43,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-28 23:52:43,846 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-11-28 23:52:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:43,852 INFO L225 Difference]: With dead ends: 1367 [2023-11-28 23:52:43,852 INFO L226 Difference]: Without dead ends: 1365 [2023-11-28 23:52:43,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 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 23:52:43,853 INFO L413 NwaCegarLoop]: 1156 mSDtfsCounter, 12 mSDsluCounter, 5770 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6926 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:43,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6926 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-28 23:52:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2023-11-28 23:52:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1361. [2023-11-28 23:52:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 759 states have (on average 1.9552042160737813) internal successors, (1484), 1350 states have internal predecessors, (1484), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-28 23:52:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1510 transitions. [2023-11-28 23:52:43,877 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1510 transitions. Word has length 63 [2023-11-28 23:52:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:43,877 INFO L495 AbstractCegarLoop]: Abstraction has 1361 states and 1510 transitions. [2023-11-28 23:52:43,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 23:52:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1510 transitions. [2023-11-28 23:52:43,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-28 23:52:43,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:43,878 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:43,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:44,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:52:44,079 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:52:44,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:44,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1835494168, now seen corresponding path program 3 times [2023-11-28 23:52:44,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:52:44,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121632420] [2023-11-28 23:52:44,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 23:52:44,080 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 23:52:44,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:52:44,081 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:44,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:44,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-28 23:52:44,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:52:44,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-28 23:52:44,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:44,958 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 23:52:44,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:52:45,623 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 23:52:45,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:45,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121632420] [2023-11-28 23:52:45,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121632420] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:52:45,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:52:45,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-28 23:52:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30650714] [2023-11-28 23:52:45,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:52:45,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-28 23:52:45,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:45,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-28 23:52:45,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-28 23:52:45,626 INFO L87 Difference]: Start difference. First operand 1361 states and 1510 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 23:52:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:52:53,086 INFO L93 Difference]: Finished difference Result 1391 states and 1574 transitions. [2023-11-28 23:52:53,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-28 23:52:53,087 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2023-11-28 23:52:53,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:52:53,092 INFO L225 Difference]: With dead ends: 1391 [2023-11-28 23:52:53,092 INFO L226 Difference]: Without dead ends: 1388 [2023-11-28 23:52:53,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-28 23:52:53,094 INFO L413 NwaCegarLoop]: 1154 mSDtfsCounter, 25 mSDsluCounter, 13818 mSDsCounter, 0 mSdLazyCounter, 2888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 14972 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:52:53,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 14972 Invalid, 2917 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 2888 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2023-11-28 23:52:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2023-11-28 23:52:53,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1379. [2023-11-28 23:52:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 777 states have (on average 1.9395109395109396) internal successors, (1507), 1368 states have internal predecessors, (1507), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-28 23:52:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1533 transitions. [2023-11-28 23:52:53,124 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1533 transitions. Word has length 69 [2023-11-28 23:52:53,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:52:53,124 INFO L495 AbstractCegarLoop]: Abstraction has 1379 states and 1533 transitions. [2023-11-28 23:52:53,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 23:52:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1533 transitions. [2023-11-28 23:52:53,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-28 23:52:53,125 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:52:53,125 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:52:53,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:53,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:52:53,326 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:52:53,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:52:53,326 INFO L85 PathProgramCache]: Analyzing trace with hash -111751080, now seen corresponding path program 4 times [2023-11-28 23:52:53,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:52:53,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117767720] [2023-11-28 23:52:53,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 23:52:53,328 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 23:52:53,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:52:53,329 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:53,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:52:53,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 23:52:53,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:52:53,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-28 23:52:53,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:52:54,096 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 23:52:54,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:52:55,531 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 23:52:55,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:52:55,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117767720] [2023-11-28 23:52:55,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117767720] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:52:55,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:52:55,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-28 23:52:55,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424886442] [2023-11-28 23:52:55,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:52:55,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-28 23:52:55,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:52:55,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-28 23:52:55,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-28 23:52:55,535 INFO L87 Difference]: Start difference. First operand 1379 states and 1533 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 23:53:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:53:12,297 INFO L93 Difference]: Finished difference Result 1436 states and 1643 transitions. [2023-11-28 23:53:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-28 23:53:12,298 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2023-11-28 23:53:12,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:53:12,302 INFO L225 Difference]: With dead ends: 1436 [2023-11-28 23:53:12,302 INFO L226 Difference]: Without dead ends: 1434 [2023-11-28 23:53:12,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-28 23:53:12,306 INFO L413 NwaCegarLoop]: 1156 mSDtfsCounter, 48 mSDsluCounter, 26542 mSDsCounter, 0 mSdLazyCounter, 6534 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 27698 SdHoareTripleChecker+Invalid, 6689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 6534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2023-11-28 23:53:12,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 27698 Invalid, 6689 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [155 Valid, 6534 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2023-11-28 23:53:12,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2023-11-28 23:53:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1413. [2023-11-28 23:53:12,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 811 states have (on average 1.9149198520345252) internal successors, (1553), 1402 states have internal predecessors, (1553), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-28 23:53:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1579 transitions. [2023-11-28 23:53:12,336 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1579 transitions. Word has length 81 [2023-11-28 23:53:12,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:53:12,336 INFO L495 AbstractCegarLoop]: Abstraction has 1413 states and 1579 transitions. [2023-11-28 23:53:12,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-28 23:53:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1579 transitions. [2023-11-28 23:53:12,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-28 23:53:12,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:53:12,338 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:53:12,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:53:12,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:53:12,544 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:53:12,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:53:12,544 INFO L85 PathProgramCache]: Analyzing trace with hash -353151496, now seen corresponding path program 5 times [2023-11-28 23:53:12,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:53:12,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136526851] [2023-11-28 23:53:12,545 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 23:53:12,545 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 23:53:12,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:53:12,546 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:53:12,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:53:13,844 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-28 23:53:13,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:53:13,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-28 23:53:13,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:53:13,886 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 23:53:13,984 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:53:13,984 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 23:53:14,014 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 23:53:14,112 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 23:53:15,063 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:53:15,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-28 23:53:15,108 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 23:53:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-28 23:53:15,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:53:19,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:53:19,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136526851] [2023-11-28 23:53:19,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136526851] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:53:19,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1707482850] [2023-11-28 23:53:19,611 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 23:53:19,611 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:53:19,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:53:19,612 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:53:19,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-11-28 23:54:19,929 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-28 23:54:19,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:54:20,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-28 23:54:20,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:54:20,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-28 23:54:20,435 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:54:20,436 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 23:54:20,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-28 23:54:21,066 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:54:21,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:54:21,121 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 23:54:21,124 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 23:54:21,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:54:21,521 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-11-28 23:54:21,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-11-28 23:54:21,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1707482850] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:54:21,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:54:21,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-11-28 23:54:21,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255996571] [2023-11-28 23:54:21,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:54:21,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-28 23:54:21,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:54:21,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-28 23:54:21,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=347, Unknown=16, NotChecked=0, Total=420 [2023-11-28 23:54:21,606 INFO L87 Difference]: Start difference. First operand 1413 states and 1579 transitions. Second operand has 18 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:54:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:54:39,890 INFO L93 Difference]: Finished difference Result 2212 states and 2413 transitions. [2023-11-28 23:54:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-28 23:54:39,890 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2023-11-28 23:54:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:54:39,894 INFO L225 Difference]: With dead ends: 2212 [2023-11-28 23:54:39,894 INFO L226 Difference]: Without dead ends: 2210 [2023-11-28 23:54:39,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=107, Invalid=577, Unknown=18, NotChecked=0, Total=702 [2023-11-28 23:54:39,895 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 1551 mSDsluCounter, 8065 mSDsCounter, 0 mSdLazyCounter, 9797 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 8760 SdHoareTripleChecker+Invalid, 9838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 9797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2023-11-28 23:54:39,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 8760 Invalid, 9838 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [41 Valid, 9797 Invalid, 0 Unknown, 0 Unchecked, 17.9s Time] [2023-11-28 23:54:39,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2023-11-28 23:54:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 1459. [2023-11-28 23:54:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 857 states have (on average 1.865810968494749) internal successors, (1599), 1447 states have internal predecessors, (1599), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-28 23:54:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1625 transitions. [2023-11-28 23:54:39,924 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1625 transitions. Word has length 103 [2023-11-28 23:54:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:54:39,925 INFO L495 AbstractCegarLoop]: Abstraction has 1459 states and 1625 transitions. [2023-11-28 23:54:39,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:54:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1625 transitions. [2023-11-28 23:54:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-28 23:54:39,927 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:54:39,927 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:54:39,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-28 23:54:40,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-11-28 23:54:40,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 23:54:40,332 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:54:40,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:54:40,333 INFO L85 PathProgramCache]: Analyzing trace with hash -353151495, now seen corresponding path program 1 times [2023-11-28 23:54:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:54:40,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81505586] [2023-11-28 23:54:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:54:40,333 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 23:54:40,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:54:40,334 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:54:40,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:54:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:54:41,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-28 23:54:41,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:54:41,017 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 23:54:41,119 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 23:54:41,133 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:54:41,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-28 23:54:41,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-28 23:54:41,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-28 23:54:41,280 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 23:54:41,285 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 23:54:42,000 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:54:42,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:54:42,007 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 23:54:42,065 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 23:54:42,074 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 23:54:42,101 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 23:54:42,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:54:43,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2669 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:54:43,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:54:43,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81505586] [2023-11-28 23:54:43,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81505586] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:54:43,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [215979361] [2023-11-28 23:54:43,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:54:43,398 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:54:43,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:54:43,399 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:54:43,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-28 23:56:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:30,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-28 23:56:30,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:30,578 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 23:56:30,834 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 23:56:30,848 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:56:30,848 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 23:56:30,897 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 23:56:30,911 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 23:56:31,068 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 23:56:31,072 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 23:56:31,754 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:56:31,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:56:31,764 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 23:56:31,845 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 23:56:31,853 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 23:56:31,858 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 23:56:31,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:56:33,186 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3206 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3207 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-28 23:56:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [215979361] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:56:33,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:56:33,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-28 23:56:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60428204] [2023-11-28 23:56:33,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:56:33,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-28 23:56:33,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:56:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-28 23:56:33,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-28 23:56:33,194 INFO L87 Difference]: Start difference. First operand 1459 states and 1625 transitions. Second operand has 13 states, 10 states have (on average 11.2) internal successors, (112), 13 states have internal predecessors, (112), 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 23:56:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:56:49,295 INFO L93 Difference]: Finished difference Result 2208 states and 2405 transitions. [2023-11-28 23:56:49,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 23:56:49,296 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 11.2) internal successors, (112), 13 states have internal predecessors, (112), 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 103 [2023-11-28 23:56:49,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:56:49,301 INFO L225 Difference]: With dead ends: 2208 [2023-11-28 23:56:49,301 INFO L226 Difference]: Without dead ends: 2208 [2023-11-28 23:56:49,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 194 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 23:56:49,302 INFO L413 NwaCegarLoop]: 706 mSDtfsCounter, 2453 mSDsluCounter, 3180 mSDsCounter, 0 mSdLazyCounter, 7793 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2471 SdHoareTripleChecker+Valid, 3886 SdHoareTripleChecker+Invalid, 7830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 7793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2023-11-28 23:56:49,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2471 Valid, 3886 Invalid, 7830 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [37 Valid, 7793 Invalid, 0 Unknown, 0 Unchecked, 15.8s Time] [2023-11-28 23:56:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2023-11-28 23:56:49,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1458. [2023-11-28 23:56:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 857 states have (on average 1.8646441073512252) internal successors, (1598), 1446 states have internal predecessors, (1598), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-28 23:56:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1624 transitions. [2023-11-28 23:56:49,329 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1624 transitions. Word has length 103 [2023-11-28 23:56:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:56:49,329 INFO L495 AbstractCegarLoop]: Abstraction has 1458 states and 1624 transitions. [2023-11-28 23:56:49,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 11.2) internal successors, (112), 13 states have internal predecessors, (112), 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 23:56:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1624 transitions. [2023-11-28 23:56:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-28 23:56:49,330 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:56:49,330 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:56:49,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-28 23:56:49,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:56:49,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:56:49,731 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:56:49,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:56:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash -73927601, now seen corresponding path program 1 times [2023-11-28 23:56:49,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:56:49,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83798019] [2023-11-28 23:56:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:49,733 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 23:56:49,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:56:49,734 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:56:49,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:56:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:50,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-28 23:56:50,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:50,517 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 23:56:50,637 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:56:50,638 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 23:56:50,672 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 23:56:50,792 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 23:56:51,762 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:56:51,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:56:51,867 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:56:51,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:56:51,882 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 23:56:51,915 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 23:56:51,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:56:56,030 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 23:56:56,452 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3661 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3661))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3615)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:56:56,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:56:56,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83798019] [2023-11-28 23:56:56,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83798019] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:56:56,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1410229375] [2023-11-28 23:56:56,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:56:56,455 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:56:56,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:56:56,456 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:56:56,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-28 23:56:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:56:59,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-28 23:56:59,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:56:59,681 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 23:56:59,974 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:56:59,975 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 23:57:00,012 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 23:57:00,669 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:57:00,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:57:00,833 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:57:00,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:57:00,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-28 23:57:00,850 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 23:57:00,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:57:03,883 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-11-28 23:57:03,883 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 37 treesize of output 36 [2023-11-28 23:57:03,895 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4115))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3615)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-28 23:57:03,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1410229375] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:57:03,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:57:03,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-11-28 23:57:03,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544630980] [2023-11-28 23:57:03,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:57:03,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-28 23:57:03,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:57:03,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-28 23:57:03,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=398, Unknown=6, NotChecked=126, Total=600 [2023-11-28 23:57:03,900 INFO L87 Difference]: Start difference. First operand 1458 states and 1624 transitions. Second operand has 20 states, 17 states have (on average 7.117647058823529) internal successors, (121), 19 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:57:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:57:19,259 INFO L93 Difference]: Finished difference Result 2208 states and 2407 transitions. [2023-11-28 23:57:19,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-28 23:57:19,259 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.117647058823529) internal successors, (121), 19 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2023-11-28 23:57:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:57:19,264 INFO L225 Difference]: With dead ends: 2208 [2023-11-28 23:57:19,264 INFO L226 Difference]: Without dead ends: 2208 [2023-11-28 23:57:19,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=130, Invalid=688, Unknown=6, NotChecked=168, Total=992 [2023-11-28 23:57:19,265 INFO L413 NwaCegarLoop]: 694 mSDtfsCounter, 2457 mSDsluCounter, 5960 mSDsCounter, 0 mSdLazyCounter, 7417 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2478 SdHoareTripleChecker+Valid, 6654 SdHoareTripleChecker+Invalid, 7476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 7417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2023-11-28 23:57:19,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2478 Valid, 6654 Invalid, 7476 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 7417 Invalid, 0 Unknown, 0 Unchecked, 14.9s Time] [2023-11-28 23:57:19,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2023-11-28 23:57:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1457. [2023-11-28 23:57:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 857 states have (on average 1.8634772462077014) internal successors, (1597), 1445 states have internal predecessors, (1597), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-28 23:57:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1623 transitions. [2023-11-28 23:57:19,291 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1623 transitions. Word has length 105 [2023-11-28 23:57:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:57:19,291 INFO L495 AbstractCegarLoop]: Abstraction has 1457 states and 1623 transitions. [2023-11-28 23:57:19,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.117647058823529) internal successors, (121), 19 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:57:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1623 transitions. [2023-11-28 23:57:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-28 23:57:19,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:57:19,292 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:57:19,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:57:19,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-28 23:57:19,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 23:57:19,692 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:57:19,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:57:19,693 INFO L85 PathProgramCache]: Analyzing trace with hash -73927600, now seen corresponding path program 1 times [2023-11-28 23:57:19,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:57:19,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956710879] [2023-11-28 23:57:19,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:57:19,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 23:57:19,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:57:19,694 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:57:19,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:57:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:57:20,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-28 23:57:20,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:57:20,520 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 23:57:20,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-28 23:57:20,646 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:57:20,646 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 23:57:20,667 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 23:57:20,671 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 23:57:20,775 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 23:57:20,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 23:57:21,405 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:57:21,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:57:21,412 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 23:57:21,523 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:57:21,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:57:21,528 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 23:57:21,547 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 23:57:21,553 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 23:57:21,576 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 23:57:21,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:57:21,715 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4569 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:57:21,750 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4569 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-11-28 23:57:23,059 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4569 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4660 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4660))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4661) .cse0 v_ArrVal_4569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4569 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4660 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4661) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4569) |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 23:57:23,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:57:23,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956710879] [2023-11-28 23:57:23,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956710879] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:57:23,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [289698692] [2023-11-28 23:57:23,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:57:23,071 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:57:23,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:57:23,072 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:57:23,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-28 23:57:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:57:26,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-28 23:57:26,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:57:26,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 23:57:26,738 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:57:26,739 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 23:57:26,748 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 23:57:26,796 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 23:57:26,802 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 23:57:26,938 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 23:57:26,942 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 23:57:27,582 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:57:27,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-28 23:57:27,589 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 23:57:27,743 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:57:27,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:57:27,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-28 23:57:27,768 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 23:57:27,776 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 23:57:27,777 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 23:57:27,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:57:27,827 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5114 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:57:27,860 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5114 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-28 23:57:29,222 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5114 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5206) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5114 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5207))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5206) .cse2 v_ArrVal_5114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-28 23:57:29,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [289698692] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:57:29,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:57:29,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-28 23:57:29,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238419325] [2023-11-28 23:57:29,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:57:29,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-28 23:57:29,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:57:29,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-28 23:57:29,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-28 23:57:29,233 INFO L87 Difference]: Start difference. First operand 1457 states and 1623 transitions. Second operand has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:57:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:57:43,163 INFO L93 Difference]: Finished difference Result 2206 states and 2403 transitions. [2023-11-28 23:57:43,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 23:57:43,164 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2023-11-28 23:57:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:57:43,168 INFO L225 Difference]: With dead ends: 2206 [2023-11-28 23:57:43,168 INFO L226 Difference]: Without dead ends: 2206 [2023-11-28 23:57:43,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-28 23:57:43,169 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 1536 mSDsluCounter, 2765 mSDsCounter, 0 mSdLazyCounter, 6191 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 3470 SdHoareTripleChecker+Invalid, 6210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 6191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2023-11-28 23:57:43,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 3470 Invalid, 6210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 6191 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2023-11-28 23:57:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2023-11-28 23:57:43,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 1456. [2023-11-28 23:57:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 857 states have (on average 1.8623103850641773) internal successors, (1596), 1444 states have internal predecessors, (1596), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-28 23:57:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1622 transitions. [2023-11-28 23:57:43,191 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1622 transitions. Word has length 105 [2023-11-28 23:57:43,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:57:43,191 INFO L495 AbstractCegarLoop]: Abstraction has 1456 states and 1622 transitions. [2023-11-28 23:57:43,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:57:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1622 transitions. [2023-11-28 23:57:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-28 23:57:43,192 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:57:43,192 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:57:43,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-28 23:57:43,401 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:57:43,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:57:43,592 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:57:43,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:57:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1972257600, now seen corresponding path program 1 times [2023-11-28 23:57:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:57:43,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907831966] [2023-11-28 23:57:43,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:57:43,594 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 23:57:43,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:57:43,594 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:57:43,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:57:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:57:44,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-28 23:57:44,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:57:44,484 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 23:57:44,618 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:57:44,618 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 23:57:44,649 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 23:57:44,745 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 23:57:45,640 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:57:45,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:57:45,744 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:57:45,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:57:45,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:57:45,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-28 23:57:45,833 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 23:57:45,873 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 23:57:45,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:57:45,940 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5631) |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 23:57:45,952 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 23:57:45,967 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5630))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5631)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 23:57:45,983 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5630))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5631)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 23:57:46,387 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5677 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5677))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5630)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5631)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:57:46,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:57:46,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907831966] [2023-11-28 23:57:46,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907831966] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:57:46,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1870050924] [2023-11-28 23:57:46,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:57:46,391 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:57:46,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:57:46,391 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:57:46,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-28 23:57:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:57:49,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-28 23:57:49,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:57:50,002 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 23:57:50,280 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:57:50,281 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 23:57:50,326 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 23:57:50,988 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:57:50,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:57:51,145 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:57:51,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:57:51,244 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:57:51,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:57:51,253 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 23:57:51,256 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 23:57:51,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:57:51,270 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6100 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6100) |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 23:57:51,281 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6100 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 23:57:51,294 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6100 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6099))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6100)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:57:51,307 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6100 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6099))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6100)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 23:57:51,742 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2023-11-28 23:57:51,742 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 61 treesize of output 60 [2023-11-28 23:57:51,755 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6146 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6146))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6099)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6100)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-28 23:57:51,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1870050924] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:57:51,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:57:51,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2023-11-28 23:57:51,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990370606] [2023-11-28 23:57:51,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:57:51,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-28 23:57:51,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:57:51,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-28 23:57:51,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=446, Unknown=10, NotChecked=510, Total=1056 [2023-11-28 23:57:51,760 INFO L87 Difference]: Start difference. First operand 1456 states and 1622 transitions. Second operand has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:58:10,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:58:10,551 INFO L93 Difference]: Finished difference Result 2206 states and 2405 transitions. [2023-11-28 23:58:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-28 23:58:10,552 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2023-11-28 23:58:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:58:10,556 INFO L225 Difference]: With dead ends: 2206 [2023-11-28 23:58:10,556 INFO L226 Difference]: Without dead ends: 2206 [2023-11-28 23:58:10,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=160, Invalid=800, Unknown=10, NotChecked=670, Total=1640 [2023-11-28 23:58:10,557 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 2448 mSDsluCounter, 7756 mSDsCounter, 0 mSdLazyCounter, 9547 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2469 SdHoareTripleChecker+Valid, 8449 SdHoareTripleChecker+Invalid, 9606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 9547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2023-11-28 23:58:10,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2469 Valid, 8449 Invalid, 9606 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 9547 Invalid, 0 Unknown, 0 Unchecked, 18.3s Time] [2023-11-28 23:58:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2023-11-28 23:58:10,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 1455. [2023-11-28 23:58:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 857 states have (on average 1.8611435239206535) internal successors, (1595), 1443 states have internal predecessors, (1595), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-28 23:58:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1621 transitions. [2023-11-28 23:58:10,571 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1621 transitions. Word has length 107 [2023-11-28 23:58:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:58:10,571 INFO L495 AbstractCegarLoop]: Abstraction has 1455 states and 1621 transitions. [2023-11-28 23:58:10,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:58:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1621 transitions. [2023-11-28 23:58:10,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-28 23:58:10,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:58:10,572 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:58:10,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-11-28 23:58:10,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-11-28 23:58:10,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:58:10,973 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:58:10,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:10,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1972257601, now seen corresponding path program 1 times [2023-11-28 23:58:10,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:10,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74572767] [2023-11-28 23:58:10,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:10,974 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 23:58:10,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:10,975 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:58:10,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:58:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:11,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-28 23:58:11,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:11,965 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 23:58:12,081 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 23:58:12,098 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:58:12,098 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 23:58:12,119 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 23:58:12,126 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 23:58:12,215 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 23:58:12,219 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 23:58:12,877 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:58:12,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:58:12,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-28 23:58:12,987 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:58:12,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:58:13,000 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 23:58:13,092 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:58:13,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:58:13,105 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 23:58:13,117 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 23:58:13,122 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 23:58:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-28 23:58:13,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:58:13,312 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:58:13,345 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-28 23:58:13,477 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6614) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6615))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6614) .cse2 v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-28 23:58:13,576 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6614) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6615))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6614) .cse3 v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-28 23:58:15,717 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6709 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6709))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6615))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6708) .cse0 v_ArrVal_6614) .cse1 v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6709 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6709))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6708) .cse6 v_ArrVal_6614) (select (select (store .cse7 .cse6 v_ArrVal_6615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6617))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-28 23:58:15,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:15,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74572767] [2023-11-28 23:58:15,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74572767] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:58:15,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1014058395] [2023-11-28 23:58:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:15,733 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:58:15,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:58:15,734 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:58:15,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-28 23:58:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:31,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-28 23:58:31,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:31,415 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 23:58:31,896 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:58:31,896 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 23:58:31,906 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 23:58:32,001 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 23:58:32,023 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 23:58:32,282 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 23:58:32,289 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 23:58:33,251 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:58:33,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-28 23:58:33,264 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 23:58:33,504 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:58:33,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:58:33,515 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 23:58:33,677 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:58:33,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:58:33,688 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 23:58:33,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-28 23:58:33,717 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 23:58:33,727 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 23:58:33,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:58:33,794 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7180) |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 23:58:33,832 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-28 23:58:33,932 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7177))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7178) .cse0 v_ArrVal_7180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7178) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7180) |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 23:58:34,173 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7177))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7178) .cse1 v_ArrVal_7180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7178) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2023-11-28 23:58:36,253 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7272))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7271) .cse1 v_ArrVal_7178) (select (select (store .cse2 .cse1 v_ArrVal_7177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7180))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7272))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7177))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7271) .cse4 v_ArrVal_7178) .cse5 v_ArrVal_7180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-28 23:58:36,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1014058395] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:58:36,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:58:36,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-28 23:58:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653715622] [2023-11-28 23:58:36,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:58:36,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-28 23:58:36,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:36,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-28 23:58:36,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-28 23:58:36,271 INFO L87 Difference]: Start difference. First operand 1455 states and 1621 transitions. Second operand has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:58:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:58:59,994 INFO L93 Difference]: Finished difference Result 2204 states and 2401 transitions. [2023-11-28 23:58:59,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 23:58:59,994 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2023-11-28 23:58:59,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:58:59,999 INFO L225 Difference]: With dead ends: 2204 [2023-11-28 23:58:59,999 INFO L226 Difference]: Without dead ends: 2204 [2023-11-28 23:58:59,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-28 23:58:59,999 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 2442 mSDsluCounter, 2822 mSDsCounter, 0 mSdLazyCounter, 6854 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2460 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 6890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 6854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:59:00,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2460 Valid, 3527 Invalid, 6890 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [36 Valid, 6854 Invalid, 0 Unknown, 0 Unchecked, 23.2s Time] [2023-11-28 23:59:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2023-11-28 23:59:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1454. [2023-11-28 23:59:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 857 states have (on average 1.8599766627771295) internal successors, (1594), 1442 states have internal predecessors, (1594), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-28 23:59:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1620 transitions. [2023-11-28 23:59:00,013 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1620 transitions. Word has length 107 [2023-11-28 23:59:00,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:59:00,014 INFO L495 AbstractCegarLoop]: Abstraction has 1454 states and 1620 transitions. [2023-11-28 23:59:00,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:59:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1620 transitions. [2023-11-28 23:59:00,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-28 23:59:00,014 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:59:00,014 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:59:00,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2023-11-28 23:59:00,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:59:00,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.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 23:59:00,415 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:59:00,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:00,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1261209612, now seen corresponding path program 1 times [2023-11-28 23:59:00,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:59:00,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120238569] [2023-11-28 23:59:00,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:59:00,416 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 23:59:00,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:59:00,417 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:59:00,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:59:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:59:01,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-28 23:59:01,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:59:01,503 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 23:59:01,752 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 23:59:01,752 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 23:59:01,800 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 23:59:01,970 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 23:59:03,296 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:59:03,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:59:03,469 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:59:03,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:59:03,614 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:59:03,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-28 23:59:03,756 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:59:03,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:59:03,781 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 23:59:03,850 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 23:59:03,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:59:03,954 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7712) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-11-28 23:59:03,974 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-28 23:59:03,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7711))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7712)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:59:04,016 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7711))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7712)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:59:04,040 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7710))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7711)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7712)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:59:04,065 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7710))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7711)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7712)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:59:04,555 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7758 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7758))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7710)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7711)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7712)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:59:04,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:59:04,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120238569] [2023-11-28 23:59:04,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120238569] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:59:04,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1226972407] [2023-11-28 23:59:04,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:59:04,562 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-28 23:59:04,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-28 23:59:04,563 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-28 23:59:04,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-28 23:59:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:59:14,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-28 23:59:14,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:59:14,531 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 23:59:15,018 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:59:15,018 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 23:59:15,084 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 23:59:16,082 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:59:16,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:59:16,346 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:59:16,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 23:59:16,520 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:59:16,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:59:16,686 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-28 23:59:16,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-28 23:59:16,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-28 23:59:16,712 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 23:59:16,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:59:16,738 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8197) |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 23:59:16,756 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 23:59:16,778 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8196))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8197)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:59:16,799 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8196))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8197)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:59:16,822 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8195))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8196)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8197)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:59:16,848 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8195 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8195))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8196)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8197)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 23:59:17,394 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-11-28 23:59:17,394 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 109 treesize of output 108 [2023-11-28 23:59:17,416 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8195 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8243))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8195)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8196)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8197)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-28 23:59:17,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1226972407] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:59:17,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:59:17,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 [2023-11-28 23:59:17,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695872537] [2023-11-28 23:59:17,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:59:17,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-28 23:59:17,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:59:17,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-28 23:59:17,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=534, Unknown=14, NotChecked=826, Total=1482 [2023-11-28 23:59:17,422 INFO L87 Difference]: Start difference. First operand 1454 states and 1620 transitions. Second operand has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 23 states have internal predecessors, (129), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:59:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 23:59:47,506 INFO L93 Difference]: Finished difference Result 2204 states and 2403 transitions. [2023-11-28 23:59:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-28 23:59:47,507 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 23 states have internal predecessors, (129), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 109 [2023-11-28 23:59:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 23:59:47,511 INFO L225 Difference]: With dead ends: 2204 [2023-11-28 23:59:47,511 INFO L226 Difference]: Without dead ends: 2204 [2023-11-28 23:59:47,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=189, Invalid=975, Unknown=14, NotChecked=1078, Total=2256 [2023-11-28 23:59:47,513 INFO L413 NwaCegarLoop]: 692 mSDtfsCounter, 2445 mSDsluCounter, 7652 mSDsCounter, 0 mSdLazyCounter, 9396 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2466 SdHoareTripleChecker+Valid, 8344 SdHoareTripleChecker+Invalid, 9456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 9396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.2s IncrementalHoareTripleChecker+Time [2023-11-28 23:59:47,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2466 Valid, 8344 Invalid, 9456 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 9396 Invalid, 0 Unknown, 0 Unchecked, 29.2s Time] [2023-11-28 23:59:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2023-11-28 23:59:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1453. [2023-11-28 23:59:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 857 states have (on average 1.8588098016336057) internal successors, (1593), 1441 states have internal predecessors, (1593), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-28 23:59:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1619 transitions. [2023-11-28 23:59:47,531 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1619 transitions. Word has length 109 [2023-11-28 23:59:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 23:59:47,531 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 1619 transitions. [2023-11-28 23:59:47,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 23 states have internal predecessors, (129), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-28 23:59:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1619 transitions. [2023-11-28 23:59:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-28 23:59:47,532 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 23:59:47,532 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:59:47,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:59:47,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-28 23:59:47,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-28 23:59:47,933 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-28 23:59:47,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:47,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1261209613, now seen corresponding path program 1 times [2023-11-28 23:59:47,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:59:47,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415073589] [2023-11-28 23:59:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:59:47,934 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 23:59:47,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:59:47,935 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:59:47,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 23:59:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:59:49,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-28 23:59:49,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:59:49,140 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 23:59:49,364 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 23:59:49,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-28 23:59:49,375 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 23:59:49,414 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 23:59: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 19 treesize of output 1 [2023-11-28 23:59:49,595 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 23:59:49,601 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 23:59:50,663 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:59:50,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:59:50,671 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 23:59:50,842 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:59:50,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:59:50,851 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 23:59:50,995 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:59:50,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:59:51,003 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 23:59:51,154 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-28 23:59:51,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23:59:51,162 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 23:59:51,189 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 23:59:51,200 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 23:59:51,250 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 23:59:51,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:59:51,453 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-28 23:59:51,508 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8730) |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 23:59:51,610 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8729) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8728))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8729) .cse2 v_ArrVal_8730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-28 23:59:51,747 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8728))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8729) .cse1 v_ArrVal_8730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8729) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8730) |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 23:59:52,752 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8727))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8728))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8726) .cse0 v_ArrVal_8729) .cse1 v_ArrVal_8730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8727))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8726) .cse6 v_ArrVal_8729) (select (select (store .cse7 .cse6 v_ArrVal_8728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8730))) |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 23:59:53,928 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8727))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8728))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8726) .cse1 v_ArrVal_8729) .cse2 v_ArrVal_8730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8727))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8726) .cse7 v_ArrVal_8729) (select (select (store .cse8 .cse7 v_ArrVal_8728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8730))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 00:00:00,224 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8822))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_8727))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8823) .cse1 v_ArrVal_8726) .cse2 v_ArrVal_8729) (select (select (store .cse3 .cse2 v_ArrVal_8728) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8730))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8726 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8822))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_8727))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_8728))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8823) .cse6 v_ArrVal_8726) .cse7 v_ArrVal_8729) .cse8 v_ArrVal_8730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 00:00:00,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:00:00,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415073589] [2023-11-29 00:00:00,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415073589] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:00:00,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1394321906] [2023-11-29 00:00:00,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:00:00,265 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:00:00,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:00:00,266 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:00:00,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 00:00:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:00:20,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 00:00:20,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:00:20,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:00:23,040 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:00:23,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:00:23,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:00:23,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:00:23,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:00:25,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 00:00:25,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:00:30,429 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:00:30,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:00:30,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:00:31,807 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:00:31,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:00:31,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:00:32,746 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:00:32,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:00:32,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:00:33,704 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:00:33,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:00:33,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:00:33,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:00:33,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:00:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:00:33,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:00:34,194 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9311 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:00:34,319 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9311 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2023-11-29 00:00:34,559 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9308))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9309) .cse0 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9309) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9308) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 00:00:34,828 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9309) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9308) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9308))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9309) .cse3 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 00:00:42,548 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9307))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9308))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9306) .cse1 v_ArrVal_9309) .cse2 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9307))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9306) .cse7 v_ArrVal_9309) (select (select (store .cse8 .cse7 v_ArrVal_9308) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9310))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 00:00:50,985 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9402 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9402))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9307))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9308))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9403) .cse0 v_ArrVal_9306) .cse1 v_ArrVal_9309) .cse2 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9402 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9402))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9307))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9403) .cse8 v_ArrVal_9306) .cse9 v_ArrVal_9309) (select (select (store .cse10 .cse9 v_ArrVal_9308) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9310))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 00:00:51,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1394321906] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:00:51,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:00:51,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 00:00:51,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179253060] [2023-11-29 00:00:51,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:00:51,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 00:00:51,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:00:51,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 00:00:51,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=390, Unknown=24, NotChecked=676, Total=1190 [2023-11-29 00:00:51,023 INFO L87 Difference]: Start difference. First operand 1453 states and 1619 transitions. Second operand has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:04:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:04:00,593 INFO L93 Difference]: Finished difference Result 2202 states and 2399 transitions. [2023-11-29 00:04:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:04:00,594 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 109 [2023-11-29 00:04:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:04:00,598 INFO L225 Difference]: With dead ends: 2202 [2023-11-29 00:04:00,598 INFO L226 Difference]: Without dead ends: 2202 [2023-11-29 00:04:00,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=164, Invalid=675, Unknown=25, NotChecked=858, Total=1722 [2023-11-29 00:04:00,599 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 2438 mSDsluCounter, 4649 mSDsCounter, 0 mSdLazyCounter, 11490 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 181.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2456 SdHoareTripleChecker+Valid, 5353 SdHoareTripleChecker+Invalid, 11528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 11490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 186.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:04:00,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2456 Valid, 5353 Invalid, 11528 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 11490 Invalid, 0 Unknown, 0 Unchecked, 186.2s Time] [2023-11-29 00:04:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2023-11-29 00:04:00,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 1452. [2023-11-29 00:04:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 857 states have (on average 1.8576429404900816) internal successors, (1592), 1440 states have internal predecessors, (1592), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 00:04:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1618 transitions. [2023-11-29 00:04:00,621 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1618 transitions. Word has length 109 [2023-11-29 00:04:00,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:04:00,621 INFO L495 AbstractCegarLoop]: Abstraction has 1452 states and 1618 transitions. [2023-11-29 00:04:00,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:04:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1618 transitions. [2023-11-29 00:04:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 00:04:00,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:04:00,622 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:00,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-11-29 00:04:00,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2023-11-29 00:04:01,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:04:01,023 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 830 more)] === [2023-11-29 00:04:01,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:01,023 INFO L85 PathProgramCache]: Analyzing trace with hash 843959091, now seen corresponding path program 1 times [2023-11-29 00:04:01,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:01,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57509863] [2023-11-29 00:04:01,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:01,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:04:01,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:01,025 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:04:01,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-11-29 00:04:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:02,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 00:04:02,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:02,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:04:04,173 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:04:04,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:04:04,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:04:05,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:04:12,510 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:04:12,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:04:13,461 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:04:13,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:04:14,200 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:04:14,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:04:14,991 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:04:14,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:04:15,752 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:04:15,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:04:15,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:04:16,235 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 00:04:16,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2023-11-29 00:04:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:04:16,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:04:17,558 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9861) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-11-29 00:04:17,639 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9861) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-11-29 00:04:17,723 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9860))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9861)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:04:17,807 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9860))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9861)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:04:17,896 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9859 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9859))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9860)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9861)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 00:04:17,986 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9859 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9859))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9860)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9861)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:04:18,080 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9858 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9858))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9859)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9860)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9861)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:04:18,178 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9858 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9858))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9859)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9860)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9861)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:04:20,179 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9908 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9859 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9858 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9908))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9858)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9859)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9860)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9861)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:04:20,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:20,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57509863] [2023-11-29 00:04:20,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57509863] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:04:20,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1642854298] [2023-11-29 00:04:20,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:04:20,201 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:04:20,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:04:20,202 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:04:20,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad7e2352-7ec4-4591-a9d3-9d458d1216e5/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 00:04:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:04:27,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-29 00:04:27,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:27,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:04:30,652 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:04:30,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-29 00:04:31,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:04:37,618 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:04:37,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:04:39,143 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:04:39,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:04:40,085 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:04:40,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:04:41,112 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:04:41,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:04:42,128 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:04:42,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:04:42,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:04:42,576 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 00:04:42,577 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 21 treesize of output 20 [2023-11-29 00:04:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:04:42,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:04:47,658 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10367) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10366) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))))) is different from false [2023-11-29 00:04:47,813 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10367) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10366) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))))) is different from false [2023-11-29 00:04:47,943 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (_ BitVec 1)) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10367) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10365))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10366)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 00:04:48,072 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (_ BitVec 1)) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10367) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10365))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10366)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 00:04:48,204 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (_ BitVec 1)) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10367) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10364))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10365)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10366)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 00:04:48,337 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (_ BitVec 1)) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10367) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10364))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10365)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10366)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 00:04:48,474 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10363 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (_ BitVec 1)) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10367) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10363))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10364)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10365)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10366)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 00:04:48,613 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10363 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (_ BitVec 1)) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10367) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10363))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10364)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10365)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10366)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 00:04:51,159 INFO L349 Elim1Store]: treesize reduction 207, result has 49.4 percent of original size [2023-11-29 00:04:51,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 603 treesize of output 609 [2023-11-29 00:04:51,286 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10413 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10413))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10363)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10364)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10365)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10366)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 00:04:51,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1642854298] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:04:51,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:04:51,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2023-11-29 00:04:51,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180742767] [2023-11-29 00:04:51,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:04:51,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 00:04:51,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 00:04:51,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=669, Unknown=19, NotChecked=1242, Total=2070 [2023-11-29 00:04:51,309 INFO L87 Difference]: Start difference. First operand 1452 states and 1618 transitions. Second operand has 26 states, 23 states have (on average 5.782608695652174) internal successors, (133), 25 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)