./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/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_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/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_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/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 c78ec383567aee735f8895b5666134248c3b9de1b96295d83b3c1c6979534c2b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:28:01,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:28:01,300 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 03:28:01,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:28:01,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:28:01,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:28:01,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:28:01,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:28:01,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:28:01,336 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:28:01,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:28:01,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:28:01,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:28:01,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:28:01,339 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:28:01,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:28:01,340 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:28:01,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:28:01,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:28:01,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:28:01,342 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:28:01,342 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:28:01,343 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:28:01,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:28:01,344 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:28:01,344 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:28:01,345 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:28:01,345 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:28:01,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:28:01,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:28:01,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:28:01,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:28:01,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:28:01,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:28:01,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:28:01,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:28:01,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:28:01,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:28:01,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:28:01,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:28:01,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:28:01,350 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_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/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_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/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 -> c78ec383567aee735f8895b5666134248c3b9de1b96295d83b3c1c6979534c2b [2023-11-29 03:28:01,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:28:01,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:28:01,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:28:01,586 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:28:01,587 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:28:01,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-2.i [2023-11-29 03:28:04,383 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:28:04,699 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:28:04,699 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-2.i [2023-11-29 03:28:04,717 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/data/7a2ed6788/d5b19cb890694d63bf10746c9e31db49/FLAG27ed4bbe7 [2023-11-29 03:28:04,731 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/data/7a2ed6788/d5b19cb890694d63bf10746c9e31db49 [2023-11-29 03:28:04,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:28:04,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:28:04,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:28:04,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:28:04,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:28:04,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:28:04" (1/1) ... [2023-11-29 03:28:04,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79714a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:04, skipping insertion in model container [2023-11-29 03:28:04,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:28:04" (1/1) ... [2023-11-29 03:28:04,808 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:28:05,291 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:28:05,303 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 03:28:05,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@441e26a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:05, skipping insertion in model container [2023-11-29 03:28:05,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:28:05,304 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 03:28:05,306 INFO L158 Benchmark]: Toolchain (without parser) took 570.80ms. Allocated memory is still 148.9MB. Free memory was 114.9MB in the beginning and 91.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 03:28:05,307 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory is still 49.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:28:05,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.61ms. Allocated memory is still 148.9MB. Free memory was 114.3MB in the beginning and 91.4MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 03:28:05,308 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory is still 49.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.61ms. Allocated memory is still 148.9MB. Free memory was 114.3MB in the beginning and 91.4MB in the end (delta: 22.9MB). 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_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/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_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/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_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/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 c78ec383567aee735f8895b5666134248c3b9de1b96295d83b3c1c6979534c2b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:28:07,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:28:07,173 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 03:28:07,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:28:07,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:28:07,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:28:07,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:28:07,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:28:07,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:28:07,211 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:28:07,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:28:07,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:28:07,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:28:07,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:28:07,214 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:28:07,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:28:07,215 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:28:07,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:28:07,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:28:07,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:28:07,217 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:28:07,218 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:28:07,218 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:28:07,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:28:07,219 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:28:07,219 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:28:07,220 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:28:07,220 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:28:07,221 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:28:07,221 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:28:07,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:28:07,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:28:07,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:28:07,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:28:07,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:28:07,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:28:07,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:28:07,224 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:28:07,224 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:28:07,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:28:07,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:28:07,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:28:07,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:28:07,225 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:28:07,225 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_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/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_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/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 -> c78ec383567aee735f8895b5666134248c3b9de1b96295d83b3c1c6979534c2b [2023-11-29 03:28:07,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:28:07,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:28:07,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:28:07,562 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:28:07,562 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:28:07,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-2.i [2023-11-29 03:28:10,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:28:10,693 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:28:10,694 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-2.i [2023-11-29 03:28:10,712 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/data/abdc46a4e/c62b7cf2ec184a70abe7e42707abe597/FLAG781e1ea98 [2023-11-29 03:28:10,728 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/data/abdc46a4e/c62b7cf2ec184a70abe7e42707abe597 [2023-11-29 03:28:10,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:28:10,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:28:10,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:28:10,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:28:10,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:28:10,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:28:10" (1/1) ... [2023-11-29 03:28:10,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b40a755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:10, skipping insertion in model container [2023-11-29 03:28:10,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:28:10" (1/1) ... [2023-11-29 03:28:10,816 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:28:11,403 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:28:11,417 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 03:28:11,435 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:28:11,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:28:11,546 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:28:11,628 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:28:11,662 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 03:28:11,670 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:28:11,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:11 WrapperNode [2023-11-29 03:28:11,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:28:11,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:28:11,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:28:11,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:28:11,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:11" (1/1) ... [2023-11-29 03:28:11,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:11" (1/1) ... [2023-11-29 03:28:11,797 INFO L138 Inliner]: procedures = 180, calls = 441, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1585 [2023-11-29 03:28:11,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:28:11,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:28:11,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:28:11,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:28:11,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:11" (1/1) ... [2023-11-29 03:28:11,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:11" (1/1) ... [2023-11-29 03:28:11,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:11" (1/1) ... [2023-11-29 03:28:11,942 INFO L175 MemorySlicer]: Split 407 memory accesses to 5 slices as follows [2, 24, 5, 5, 371]. 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, 1, 1, 1, 90]. [2023-11-29 03:28:11,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:11" (1/1) ... [2023-11-29 03:28:11,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:11" (1/1) ... [2023-11-29 03:28:12,027 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:11" (1/1) ... [2023-11-29 03:28:12,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:11" (1/1) ... [2023-11-29 03:28:12,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:11" (1/1) ... [2023-11-29 03:28:12,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:11" (1/1) ... [2023-11-29 03:28:12,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:28:12,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:28:12,071 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:28:12,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:28:12,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:11" (1/1) ... [2023-11-29 03:28:12,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:28:12,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:28:12,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:28:12,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:28:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 03:28:12,141 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 03:28:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 03:28:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 03:28:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 03:28:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 03:28:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-29 03:28:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 03:28:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 03:28:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 03:28:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 03:28:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-29 03:28:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 03:28:12,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 03:28:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 03:28:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 03:28:12,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 03:28:12,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 03:28:12,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2023-11-29 03:28:12,144 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 03:28:12,144 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 03:28:12,144 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 03:28:12,145 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 03:28:12,145 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2023-11-29 03:28:12,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:28:12,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:28:12,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:28:12,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:28:12,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:28:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 03:28:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 03:28:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:28:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 03:28:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:28:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:28:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:28:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 03:28:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 03:28:12,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:28:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 03:28:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 03:28:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 03:28:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 03:28:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 03:28:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:28:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 03:28:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 03:28:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 03:28:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 03:28:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:28:12,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:28:12,409 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:28:12,411 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:28:12,440 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:28:12,472 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:28:12,495 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:28:12,517 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:28:12,541 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 03:28:19,089 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:28:19,369 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:28:19,369 INFO L309 CfgBuilder]: Removed 92 assume(true) statements. [2023-11-29 03:28:19,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:28:19 BoogieIcfgContainer [2023-11-29 03:28:19,371 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:28:19,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:28:19,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:28:19,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:28:19,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:28:10" (1/3) ... [2023-11-29 03:28:19,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734f96e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:28:19, skipping insertion in model container [2023-11-29 03:28:19,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:28:11" (2/3) ... [2023-11-29 03:28:19,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734f96e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:28:19, skipping insertion in model container [2023-11-29 03:28:19,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:28:19" (3/3) ... [2023-11-29 03:28:19,379 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-2.i [2023-11-29 03:28:19,400 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:28:19,400 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 833 error locations. [2023-11-29 03:28:19,467 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:28:19,472 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;@6f7c0ede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:28:19,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 833 error locations. [2023-11-29 03:28:19,481 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-29 03:28:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 03:28:19,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:19,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 03:28:19,487 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-29 03:28:19,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:19,493 INFO L85 PathProgramCache]: Analyzing trace with hash 79665205, now seen corresponding path program 1 times [2023-11-29 03:28:19,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:19,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349581298] [2023-11-29 03:28:19,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:19,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:19,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:19,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:28:19,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 03:28:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:19,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 03:28:19,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:28:19,744 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:28:19,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:19,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349581298] [2023-11-29 03:28:19,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349581298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:28:19,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:28:19,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:28:19,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484852974] [2023-11-29 03:28:19,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:28:19,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:28:19,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:19,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:28:19,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:28:19,785 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-29 03:28:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:20,757 INFO L93 Difference]: Finished difference Result 1487 states and 1580 transitions. [2023-11-29 03:28:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:28:20,760 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 03:28:20,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:20,782 INFO L225 Difference]: With dead ends: 1487 [2023-11-29 03:28:20,782 INFO L226 Difference]: Without dead ends: 1486 [2023-11-29 03:28:20,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:28:20,786 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-29 03:28:20,787 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-29 03:28:20,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2023-11-29 03:28:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2023-11-29 03:28:20,870 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-29 03:28:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1579 transitions. [2023-11-29 03:28:20,894 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1579 transitions. Word has length 4 [2023-11-29 03:28:20,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:20,895 INFO L495 AbstractCegarLoop]: Abstraction has 1486 states and 1579 transitions. [2023-11-29 03:28:20,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:28:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1579 transitions. [2023-11-29 03:28:20,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 03:28:20,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:20,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 03:28:20,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:28:21,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:21,097 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-29 03:28:21,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash 79665267, now seen corresponding path program 1 times [2023-11-29 03:28:21,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:21,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470426078] [2023-11-29 03:28:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:21,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:21,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:21,100 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:28:21,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 03:28:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:21,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:28:21,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:21,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:28:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:28:21,321 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:28:21,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:21,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470426078] [2023-11-29 03:28:21,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470426078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:28:21,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:28:21,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:28:21,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356789969] [2023-11-29 03:28:21,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:28:21,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:28:21,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:21,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:28:21,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:28:21,325 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-29 03:28:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:24,393 INFO L93 Difference]: Finished difference Result 1715 states and 1852 transitions. [2023-11-29 03:28:24,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:28:24,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 03:28:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:24,403 INFO L225 Difference]: With dead ends: 1715 [2023-11-29 03:28:24,403 INFO L226 Difference]: Without dead ends: 1715 [2023-11-29 03:28:24,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:28:24,404 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 1235 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:28:24,405 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.0s Time] [2023-11-29 03:28:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2023-11-29 03:28:24,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1461. [2023-11-29 03:28:24,431 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-29 03:28:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1613 transitions. [2023-11-29 03:28:24,437 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1613 transitions. Word has length 4 [2023-11-29 03:28:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:24,437 INFO L495 AbstractCegarLoop]: Abstraction has 1461 states and 1613 transitions. [2023-11-29 03:28:24,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:28:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1613 transitions. [2023-11-29 03:28:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 03:28:24,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:24,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 03:28:24,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 03:28:24,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:24,639 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-29 03:28:24,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:24,639 INFO L85 PathProgramCache]: Analyzing trace with hash 79665268, now seen corresponding path program 1 times [2023-11-29 03:28:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:24,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163536598] [2023-11-29 03:28:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:24,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:24,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:24,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:28:24,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 03:28:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:24,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:28:24,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:24,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:28:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:28:24,828 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:28:24,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:24,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163536598] [2023-11-29 03:28:24,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163536598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:28:24,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:28:24,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:28:24,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180454969] [2023-11-29 03:28:24,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:28:24,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:28:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:24,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:28:24,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:28:24,831 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-29 03:28:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:29,495 INFO L93 Difference]: Finished difference Result 1930 states and 2133 transitions. [2023-11-29 03:28:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:28:29,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 03:28:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:29,505 INFO L225 Difference]: With dead ends: 1930 [2023-11-29 03:28:29,505 INFO L226 Difference]: Without dead ends: 1930 [2023-11-29 03:28:29,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:28:29,507 INFO L413 NwaCegarLoop]: 1285 mSDtfsCounter, 673 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s 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.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:28:29,507 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.6s Time] [2023-11-29 03:28:29,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2023-11-29 03:28:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1584. [2023-11-29 03:28:29,547 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-29 03:28:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 1886 transitions. [2023-11-29 03:28:29,557 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 1886 transitions. Word has length 4 [2023-11-29 03:28:29,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:29,558 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 1886 transitions. [2023-11-29 03:28:29,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:28:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 1886 transitions. [2023-11-29 03:28:29,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 03:28:29,559 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:29,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 03:28:29,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 03:28:29,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:29,760 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-29 03:28:29,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:29,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1823652708, now seen corresponding path program 1 times [2023-11-29 03:28:29,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:29,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190174840] [2023-11-29 03:28:29,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:29,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:29,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:29,762 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:28:29,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 03:28:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:29,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:28:29,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:28:29,903 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:28:29,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:29,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190174840] [2023-11-29 03:28:29,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190174840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:28:29,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:28:29,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:28:29,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551154379] [2023-11-29 03:28:29,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:28:29,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:28:29,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:29,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:28:29,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:28:29,909 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-29 03:28:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:31,811 INFO L93 Difference]: Finished difference Result 2969 states and 3562 transitions. [2023-11-29 03:28:31,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:28:31,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 03:28:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:31,824 INFO L225 Difference]: With dead ends: 2969 [2023-11-29 03:28:31,824 INFO L226 Difference]: Without dead ends: 2969 [2023-11-29 03:28:31,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:28:31,825 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.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:28:31,826 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.9s Time] [2023-11-29 03:28:31,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2023-11-29 03:28:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1586. [2023-11-29 03:28:31,870 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-29 03:28:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 1888 transitions. [2023-11-29 03:28:31,877 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 1888 transitions. Word has length 5 [2023-11-29 03:28:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:31,878 INFO L495 AbstractCegarLoop]: Abstraction has 1586 states and 1888 transitions. [2023-11-29 03:28:31,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:28:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1888 transitions. [2023-11-29 03:28:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 03:28:31,879 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:31,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:28:31,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 03:28:32,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:32,082 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-29 03:28:32,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:32,083 INFO L85 PathProgramCache]: Analyzing trace with hash -32935171, now seen corresponding path program 1 times [2023-11-29 03:28:32,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:32,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768027038] [2023-11-29 03:28:32,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:32,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:32,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:32,085 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:28:32,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 03:28:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:32,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:28:32,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:28:32,282 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:28:32,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:32,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768027038] [2023-11-29 03:28:32,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768027038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:28:32,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:28:32,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:28:32,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883723774] [2023-11-29 03:28:32,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:28:32,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:28:32,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:32,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:28:32,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:28:32,285 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-29 03:28:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:33,426 INFO L93 Difference]: Finished difference Result 1547 states and 1848 transitions. [2023-11-29 03:28:33,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:28:33,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 03:28:33,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:33,434 INFO L225 Difference]: With dead ends: 1547 [2023-11-29 03:28:33,434 INFO L226 Difference]: Without dead ends: 1547 [2023-11-29 03:28:33,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:28:33,435 INFO L413 NwaCegarLoop]: 1268 mSDtfsCounter, 70 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:28:33,436 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.1s Time] [2023-11-29 03:28:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2023-11-29 03:28:33,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1547. [2023-11-29 03:28:33,478 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-29 03:28:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 1848 transitions. [2023-11-29 03:28:33,485 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 1848 transitions. Word has length 10 [2023-11-29 03:28:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:33,485 INFO L495 AbstractCegarLoop]: Abstraction has 1547 states and 1848 transitions. [2023-11-29 03:28:33,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:28:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1848 transitions. [2023-11-29 03:28:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 03:28:33,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:33,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:28:33,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 03:28:33,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:33,687 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-29 03:28:33,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:33,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1585930985, now seen corresponding path program 1 times [2023-11-29 03:28:33,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:33,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536062295] [2023-11-29 03:28:33,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:33,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:33,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:33,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:28:33,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 03:28:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:33,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:28:33,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:33,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:28:33,865 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:28:33,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:33,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536062295] [2023-11-29 03:28:33,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536062295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:28:33,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:28:33,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:28:33,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269493892] [2023-11-29 03:28:33,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:28:33,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:28:33,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:33,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:28:33,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:28:33,868 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-29 03:28:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:35,316 INFO L93 Difference]: Finished difference Result 1533 states and 1827 transitions. [2023-11-29 03:28:35,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:28:35,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 03:28:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:35,324 INFO L225 Difference]: With dead ends: 1533 [2023-11-29 03:28:35,324 INFO L226 Difference]: Without dead ends: 1533 [2023-11-29 03:28:35,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:28:35,325 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-29 03:28:35,325 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-29 03:28:35,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2023-11-29 03:28:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1532. [2023-11-29 03:28:35,345 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-29 03:28:35,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1826 transitions. [2023-11-29 03:28:35,350 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1826 transitions. Word has length 12 [2023-11-29 03:28:35,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:35,351 INFO L495 AbstractCegarLoop]: Abstraction has 1532 states and 1826 transitions. [2023-11-29 03:28:35,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:28:35,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1826 transitions. [2023-11-29 03:28:35,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:28:35,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:35,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:28:35,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 03:28:35,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:35,553 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-29 03:28:35,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash -993697339, now seen corresponding path program 1 times [2023-11-29 03:28:35,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:35,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024957085] [2023-11-29 03:28:35,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:35,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:35,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:35,556 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:28:35,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 03:28:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:35,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:28:35,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:35,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:28:35,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-29 03:28:35,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:28:35,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:35,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024957085] [2023-11-29 03:28:35,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024957085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:28:35,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:28:35,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:28:35,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320015398] [2023-11-29 03:28:35,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:28:35,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:28:35,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:35,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:28:35,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:28:35,848 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-29 03:28:39,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:39,596 INFO L93 Difference]: Finished difference Result 1783 states and 2062 transitions. [2023-11-29 03:28:39,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:28:39,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 03:28:39,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:39,603 INFO L225 Difference]: With dead ends: 1783 [2023-11-29 03:28:39,603 INFO L226 Difference]: Without dead ends: 1783 [2023-11-29 03:28:39,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:28:39,604 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 1170 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:28:39,604 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.7s Time] [2023-11-29 03:28:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2023-11-29 03:28:39,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1528. [2023-11-29 03:28:39,632 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-29 03:28:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1822 transitions. [2023-11-29 03:28:39,638 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1822 transitions. Word has length 26 [2023-11-29 03:28:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:39,639 INFO L495 AbstractCegarLoop]: Abstraction has 1528 states and 1822 transitions. [2023-11-29 03:28:39,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:28:39,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1822 transitions. [2023-11-29 03:28:39,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:28:39,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:39,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:28:39,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-29 03:28:39,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:39,842 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-29 03:28:39,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash -993697338, now seen corresponding path program 1 times [2023-11-29 03:28:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:39,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061926829] [2023-11-29 03:28:39,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:39,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:39,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:39,844 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:28:39,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 03:28:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:40,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:28:40,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:40,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:28:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:28:40,214 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:28:40,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:40,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061926829] [2023-11-29 03:28:40,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061926829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:28:40,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:28:40,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:28:40,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9420062] [2023-11-29 03:28:40,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:28:40,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:28:40,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:40,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:28:40,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:28:40,217 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-29 03:28:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:46,006 INFO L93 Difference]: Finished difference Result 1871 states and 2066 transitions. [2023-11-29 03:28:46,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:28:46,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 03:28:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:46,013 INFO L225 Difference]: With dead ends: 1871 [2023-11-29 03:28:46,013 INFO L226 Difference]: Without dead ends: 1871 [2023-11-29 03:28:46,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:28:46,014 INFO L413 NwaCegarLoop]: 1043 mSDtfsCounter, 610 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s 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.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:28:46,014 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.7s Time] [2023-11-29 03:28:46,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2023-11-29 03:28:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1524. [2023-11-29 03:28:46,034 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-29 03:28:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1818 transitions. [2023-11-29 03:28:46,041 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1818 transitions. Word has length 26 [2023-11-29 03:28:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:46,041 INFO L495 AbstractCegarLoop]: Abstraction has 1524 states and 1818 transitions. [2023-11-29 03:28:46,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:28:46,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1818 transitions. [2023-11-29 03:28:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 03:28:46,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:46,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:28:46,047 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 03:28:46,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:46,244 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-29 03:28:46,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1872897729, now seen corresponding path program 1 times [2023-11-29 03:28:46,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:46,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808928529] [2023-11-29 03:28:46,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:46,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:46,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:46,246 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:28:46,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 03:28:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:46,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:28:46,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:28:46,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:28:46,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:46,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808928529] [2023-11-29 03:28:46,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808928529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:28:46,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:28:46,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:28:46,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761902468] [2023-11-29 03:28:46,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:28:46,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:28:46,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:46,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:28:46,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:28:46,526 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-29 03:28:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:48,021 INFO L93 Difference]: Finished difference Result 1518 states and 1808 transitions. [2023-11-29 03:28:48,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:28:48,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-11-29 03:28:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:48,030 INFO L225 Difference]: With dead ends: 1518 [2023-11-29 03:28:48,030 INFO L226 Difference]: Without dead ends: 1518 [2023-11-29 03:28:48,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:28:48,031 INFO L413 NwaCegarLoop]: 1231 mSDtfsCounter, 23 mSDsluCounter, 2442 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:28:48,031 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.5s Time] [2023-11-29 03:28:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2023-11-29 03:28:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1518. [2023-11-29 03:28:48,053 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-29 03:28:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1808 transitions. [2023-11-29 03:28:48,059 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1808 transitions. Word has length 42 [2023-11-29 03:28:48,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:48,059 INFO L495 AbstractCegarLoop]: Abstraction has 1518 states and 1808 transitions. [2023-11-29 03:28:48,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:28:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1808 transitions. [2023-11-29 03:28:48,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 03:28:48,061 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:48,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:28:48,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 03:28:48,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:48,263 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-29 03:28:48,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:48,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1062926561, now seen corresponding path program 1 times [2023-11-29 03:28:48,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:48,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817032603] [2023-11-29 03:28:48,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:48,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:48,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:48,265 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:28:48,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 03:28:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:48,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:28:48,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:28:48,827 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:28:48,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:48,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817032603] [2023-11-29 03:28:48,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817032603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:28:48,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:28:48,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:28:48,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550736265] [2023-11-29 03:28:48,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:28:48,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:28:48,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:48,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:28:48,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:28:48,829 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-29 03:28:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:50,266 INFO L93 Difference]: Finished difference Result 1741 states and 2040 transitions. [2023-11-29 03:28:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:28:50,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-11-29 03:28:50,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:50,276 INFO L225 Difference]: With dead ends: 1741 [2023-11-29 03:28:50,276 INFO L226 Difference]: Without dead ends: 1741 [2023-11-29 03:28:50,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:28:50,277 INFO L413 NwaCegarLoop]: 1298 mSDtfsCounter, 246 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:28:50,278 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.4s Time] [2023-11-29 03:28:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2023-11-29 03:28:50,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1561. [2023-11-29 03:28:50,301 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-29 03:28:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1851 transitions. [2023-11-29 03:28:50,305 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1851 transitions. Word has length 46 [2023-11-29 03:28:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:50,305 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 1851 transitions. [2023-11-29 03:28:50,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:28:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1851 transitions. [2023-11-29 03:28:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 03:28:50,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:50,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:28:50,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 03:28:50,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:50,509 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-29 03:28:50,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1041257572, now seen corresponding path program 1 times [2023-11-29 03:28:50,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:50,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717914338] [2023-11-29 03:28:50,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:50,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:50,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:50,511 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:28:50,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 03:28:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:50,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:28:50,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:50,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:28:50,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:28:51,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:28:51,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 03:28:51,334 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:28:51,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:28:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:28:51,356 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:28:51,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:51,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717914338] [2023-11-29 03:28:51,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717914338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:28:51,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:28:51,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:28:51,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40160691] [2023-11-29 03:28:51,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:28:51,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:28:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:51,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:28:51,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:28:51,359 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-29 03:28:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:28:55,468 INFO L93 Difference]: Finished difference Result 1731 states and 2006 transitions. [2023-11-29 03:28:55,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:28:55,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-11-29 03:28:55,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:28:55,475 INFO L225 Difference]: With dead ends: 1731 [2023-11-29 03:28:55,475 INFO L226 Difference]: Without dead ends: 1731 [2023-11-29 03:28:55,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:28:55,476 INFO L413 NwaCegarLoop]: 468 mSDtfsCounter, 1377 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:28:55,476 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.1s Time] [2023-11-29 03:28:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2023-11-29 03:28:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1344. [2023-11-29 03:28:55,492 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-29 03:28:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1483 transitions. [2023-11-29 03:28:55,494 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1483 transitions. Word has length 49 [2023-11-29 03:28:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:28:55,495 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 1483 transitions. [2023-11-29 03:28:55,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:28:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1483 transitions. [2023-11-29 03:28:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 03:28:55,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:28:55,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:28:55,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 03:28:55,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:55,702 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-29 03:28:55,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:28:55,703 INFO L85 PathProgramCache]: Analyzing trace with hash -591425836, now seen corresponding path program 1 times [2023-11-29 03:28:55,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:28:55,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841037998] [2023-11-29 03:28:55,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:28:55,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:28:55,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:28:55,705 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:28:55,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 03:28:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:28:55,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:28:55,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:28:55,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:28:56,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:28:56,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:28:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:28:56,049 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:28:56,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:28:56,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841037998] [2023-11-29 03:28:56,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841037998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:28:56,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:28:56,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:28:56,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095463970] [2023-11-29 03:28:56,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:28:56,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:28:56,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:28:56,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:28:56,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:28:56,052 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-29 03:29:00,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:29:00,178 INFO L93 Difference]: Finished difference Result 1343 states and 1482 transitions. [2023-11-29 03:29:00,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:29:00,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-11-29 03:29:00,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:29:00,183 INFO L225 Difference]: With dead ends: 1343 [2023-11-29 03:29:00,183 INFO L226 Difference]: Without dead ends: 1343 [2023-11-29 03:29:00,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:29:00,184 INFO L413 NwaCegarLoop]: 1159 mSDtfsCounter, 3 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 2237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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-29 03:29:00,184 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-29 03:29:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2023-11-29 03:29:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1343. [2023-11-29 03:29:00,204 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-29 03:29:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1482 transitions. [2023-11-29 03:29:00,206 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1482 transitions. Word has length 53 [2023-11-29 03:29:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:29:00,206 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1482 transitions. [2023-11-29 03:29:00,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:29:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1482 transitions. [2023-11-29 03:29:00,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 03:29:00,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:29:00,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:29:00,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 03:29:00,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:29:00,408 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-29 03:29:00,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:29:00,408 INFO L85 PathProgramCache]: Analyzing trace with hash -591425835, now seen corresponding path program 1 times [2023-11-29 03:29:00,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:29:00,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808022455] [2023-11-29 03:29:00,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:29:00,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:29:00,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:29:00,410 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:29:00,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 03:29:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:29:00,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 03:29:00,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:29:00,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:29:00,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 19 treesize of output 1 [2023-11-29 03:29:00,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:29:00,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 03:29:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:29:00,745 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:29:00,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:29:00,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808022455] [2023-11-29 03:29:00,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808022455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:29:00,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:29:00,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:29:00,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146700154] [2023-11-29 03:29:00,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:29:00,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:29:00,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:29:00,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:29:00,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:29:00,747 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-29 03:29:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:29:06,349 INFO L93 Difference]: Finished difference Result 1342 states and 1481 transitions. [2023-11-29 03:29:06,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:29:06,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-11-29 03:29:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:29:06,354 INFO L225 Difference]: With dead ends: 1342 [2023-11-29 03:29:06,354 INFO L226 Difference]: Without dead ends: 1342 [2023-11-29 03:29:06,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:29:06,355 INFO L413 NwaCegarLoop]: 1159 mSDtfsCounter, 1 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:29:06,355 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.5s Time] [2023-11-29 03:29:06,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2023-11-29 03:29:06,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2023-11-29 03:29:06,371 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-29 03:29:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1481 transitions. [2023-11-29 03:29:06,373 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1481 transitions. Word has length 53 [2023-11-29 03:29:06,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:29:06,373 INFO L495 AbstractCegarLoop]: Abstraction has 1342 states and 1481 transitions. [2023-11-29 03:29:06,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:29:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1481 transitions. [2023-11-29 03:29:06,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 03:29:06,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:29:06,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:29:06,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 03:29:06,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:29:06,575 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-29 03:29:06,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:29:06,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1426616952, now seen corresponding path program 1 times [2023-11-29 03:29:06,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:29:06,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272184637] [2023-11-29 03:29:06,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:29:06,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:29:06,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:29:06,577 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:29:06,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 03:29:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:29:06,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:29:06,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:29:06,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-29 03:29:06,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:29:06,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:29:06,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272184637] [2023-11-29 03:29:06,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272184637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:29:06,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:29:06,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:29:06,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385058736] [2023-11-29 03:29:06,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:29:06,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:29:06,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:29:06,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:29:06,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:29:06,853 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-29 03:29:08,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:29:08,267 INFO L93 Difference]: Finished difference Result 1344 states and 1485 transitions. [2023-11-29 03:29:08,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:29:08,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-11-29 03:29:08,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:29:08,275 INFO L225 Difference]: With dead ends: 1344 [2023-11-29 03:29:08,275 INFO L226 Difference]: Without dead ends: 1344 [2023-11-29 03:29:08,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:29:08,275 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-29 03:29:08,276 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-29 03:29:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2023-11-29 03:29:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1344. [2023-11-29 03:29:08,291 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-29 03:29:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 1485 transitions. [2023-11-29 03:29:08,293 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 1485 transitions. Word has length 59 [2023-11-29 03:29:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:29:08,293 INFO L495 AbstractCegarLoop]: Abstraction has 1344 states and 1485 transitions. [2023-11-29 03:29:08,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 03:29:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1485 transitions. [2023-11-29 03:29:08,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 03:29:08,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:29:08,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:29:08,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 03:29:08,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:29:08,494 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-29 03:29:08,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:29:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash -542117052, now seen corresponding path program 1 times [2023-11-29 03:29:08,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:29:08,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980319126] [2023-11-29 03:29:08,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:29:08,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:29:08,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:29:08,496 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:29:08,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 03:29:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:29:08,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:29:08,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:29:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:29:08,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:29:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:29:08,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:29:08,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980319126] [2023-11-29 03:29:08,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980319126] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:29:08,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:29:08,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 03:29:08,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438944224] [2023-11-29 03:29:08,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:29:08,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:29:08,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:29:08,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:29:08,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:29:08,861 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-29 03:29:11,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:29:11,108 INFO L93 Difference]: Finished difference Result 1353 states and 1500 transitions. [2023-11-29 03:29:11,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:29:11,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2023-11-29 03:29:11,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:29:11,115 INFO L225 Difference]: With dead ends: 1353 [2023-11-29 03:29:11,115 INFO L226 Difference]: Without dead ends: 1353 [2023-11-29 03:29:11,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:29:11,116 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.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:29:11,116 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.2s Time] [2023-11-29 03:29:11,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2023-11-29 03:29:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1352. [2023-11-29 03:29:11,130 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-29 03:29:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1498 transitions. [2023-11-29 03:29:11,132 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1498 transitions. Word has length 60 [2023-11-29 03:29:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:29:11,132 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1498 transitions. [2023-11-29 03:29:11,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:29:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1498 transitions. [2023-11-29 03:29:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 03:29:11,133 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:29:11,133 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:29:11,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 03:29:11,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:29:11,334 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-29 03:29:11,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:29:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2092415624, now seen corresponding path program 2 times [2023-11-29 03:29:11,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:29:11,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168909791] [2023-11-29 03:29:11,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:29:11,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:29:11,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:29:11,336 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:29:11,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 03:29:11,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:29:11,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:29:11,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:29:11,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:29:11,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:29:11,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:29:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:29:12,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:29:12,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168909791] [2023-11-29 03:29:12,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168909791] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:29:12,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:29:12,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 03:29:12,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782704176] [2023-11-29 03:29:12,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:29:12,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 03:29:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:29:12,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 03:29:12,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:29:12,017 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-29 03:29:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:29:15,040 INFO L93 Difference]: Finished difference Result 1367 states and 1524 transitions. [2023-11-29 03:29:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 03:29:15,040 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-11-29 03:29:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:29:15,045 INFO L225 Difference]: With dead ends: 1367 [2023-11-29 03:29:15,046 INFO L226 Difference]: Without dead ends: 1365 [2023-11-29 03:29:15,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 03:29:15,047 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-29 03:29:15,047 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-29 03:29:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2023-11-29 03:29:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1361. [2023-11-29 03:29:15,062 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-29 03:29:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1510 transitions. [2023-11-29 03:29:15,064 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1510 transitions. Word has length 63 [2023-11-29 03:29:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:29:15,064 INFO L495 AbstractCegarLoop]: Abstraction has 1361 states and 1510 transitions. [2023-11-29 03:29:15,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:29:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1510 transitions. [2023-11-29 03:29:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 03:29:15,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:29:15,065 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:29:15,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-11-29 03:29:15,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:29:15,266 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-29 03:29:15,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:29:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1298477560, now seen corresponding path program 3 times [2023-11-29 03:29:15,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:29:15,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364750048] [2023-11-29 03:29:15,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 03:29:15,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:29:15,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:29:15,268 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:29:15,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 03:29:15,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 03:29:15,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:29:15,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:29:15,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:29:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:29:16,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:29:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:29:16,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:29:16,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364750048] [2023-11-29 03:29:16,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364750048] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:29:16,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:29:16,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 03:29:16,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120020348] [2023-11-29 03:29:16,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:29:16,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 03:29:16,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:29:16,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 03:29:16,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 03:29:16,675 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-29 03:29:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:29:24,795 INFO L93 Difference]: Finished difference Result 1391 states and 1574 transitions. [2023-11-29 03:29:24,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 03:29:24,796 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2023-11-29 03:29:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:29:24,800 INFO L225 Difference]: With dead ends: 1391 [2023-11-29 03:29:24,800 INFO L226 Difference]: Without dead ends: 1388 [2023-11-29 03:29:24,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 03:29:24,802 INFO L413 NwaCegarLoop]: 1154 mSDtfsCounter, 25 mSDsluCounter, 13818 mSDsCounter, 0 mSdLazyCounter, 2888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s 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.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:29:24,802 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.8s Time] [2023-11-29 03:29:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2023-11-29 03:29:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1379. [2023-11-29 03:29:24,825 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-29 03:29:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 1533 transitions. [2023-11-29 03:29:24,828 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 1533 transitions. Word has length 69 [2023-11-29 03:29:24,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:29:24,829 INFO L495 AbstractCegarLoop]: Abstraction has 1379 states and 1533 transitions. [2023-11-29 03:29:24,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:29:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 1533 transitions. [2023-11-29 03:29:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 03:29:24,830 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:29:24,830 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:29:24,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 03:29:25,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:29:25,031 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-29 03:29:25,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:29:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1339878136, now seen corresponding path program 4 times [2023-11-29 03:29:25,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:29:25,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601651760] [2023-11-29 03:29:25,032 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 03:29:25,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:29:25,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:29:25,033 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:29:25,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 03:29:25,390 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 03:29:25,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:29:25,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 03:29:25,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:29:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:29:25,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:29:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:29:27,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:29:27,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601651760] [2023-11-29 03:29:27,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601651760] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:29:27,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:29:27,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 03:29:27,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874590873] [2023-11-29 03:29:27,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:29:27,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 03:29:27,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:29:27,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 03:29:27,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 03:29:27,480 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-29 03:29:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:29:45,674 INFO L93 Difference]: Finished difference Result 1436 states and 1643 transitions. [2023-11-29 03:29:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 03:29:45,675 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2023-11-29 03:29:45,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:29:45,679 INFO L225 Difference]: With dead ends: 1436 [2023-11-29 03:29:45,679 INFO L226 Difference]: Without dead ends: 1434 [2023-11-29 03:29:45,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 03:29:45,684 INFO L413 NwaCegarLoop]: 1156 mSDtfsCounter, 48 mSDsluCounter, 26542 mSDsCounter, 0 mSdLazyCounter, 6534 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.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, 13.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:29:45,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 27698 Invalid, 6689 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [155 Valid, 6534 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2023-11-29 03:29:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2023-11-29 03:29:45,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1413. [2023-11-29 03:29:45,714 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-29 03:29:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1579 transitions. [2023-11-29 03:29:45,718 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1579 transitions. Word has length 81 [2023-11-29 03:29:45,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:29:45,718 INFO L495 AbstractCegarLoop]: Abstraction has 1413 states and 1579 transitions. [2023-11-29 03:29:45,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 03:29:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1579 transitions. [2023-11-29 03:29:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 03:29:45,720 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:29:45,720 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:29:45,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 03:29:45,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:29:45,926 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-29 03:29:45,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:29:45,926 INFO L85 PathProgramCache]: Analyzing trace with hash 206832504, now seen corresponding path program 5 times [2023-11-29 03:29:45,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:29:45,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801944460] [2023-11-29 03:29:45,927 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 03:29:45,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:29:45,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:29:45,928 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:29:45,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 03:29:47,241 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 03:29:47,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:29:47,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 03:29:47,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:29:47,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:29:47,374 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:29:47,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:29:47,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:29:47,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 03:29:48,442 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:29:48,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:29:48,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 03:29:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:29:48,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:29:48,945 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1685) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:29:48,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:29:48,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801944460] [2023-11-29 03:29:48,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801944460] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:29:48,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1290367262] [2023-11-29 03:29:48,948 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 03:29:48,948 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:29:48,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:29:48,949 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:29:48,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-11-29 03:30:48,481 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 03:30:48,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:30:48,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 03:30:48,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:30:48,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:30:48,929 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:30:48,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:30:48,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:30:49,544 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:30:49,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:30:49,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 03:30:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:30:49,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:30:50,009 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-11-29 03:30:50,010 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-29 03:30:50,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1290367262] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:30:50,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:30:50,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-11-29 03:30:50,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140520259] [2023-11-29 03:30:50,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:30:50,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 03:30:50,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:30:50,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 03:30:50,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=315, Unknown=13, NotChecked=36, Total=420 [2023-11-29 03:30:50,076 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-29 03:31:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:31:07,359 INFO L93 Difference]: Finished difference Result 2212 states and 2413 transitions. [2023-11-29 03:31:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:31:07,359 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-29 03:31:07,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:31:07,364 INFO L225 Difference]: With dead ends: 2212 [2023-11-29 03:31:07,364 INFO L226 Difference]: Without dead ends: 2210 [2023-11-29 03:31:07,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=535, Unknown=14, NotChecked=48, Total=702 [2023-11-29 03:31:07,365 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 1551 mSDsluCounter, 8065 mSDsCounter, 0 mSdLazyCounter, 9797 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.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, 16.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:31:07,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 8760 Invalid, 9838 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [41 Valid, 9797 Invalid, 0 Unknown, 0 Unchecked, 16.9s Time] [2023-11-29 03:31:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2023-11-29 03:31:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 1459. [2023-11-29 03:31:07,395 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-29 03:31:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1625 transitions. [2023-11-29 03:31:07,397 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1625 transitions. Word has length 103 [2023-11-29 03:31:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:31:07,398 INFO L495 AbstractCegarLoop]: Abstraction has 1459 states and 1625 transitions. [2023-11-29 03:31:07,398 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-29 03:31:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1625 transitions. [2023-11-29 03:31:07,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 03:31:07,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:31:07,399 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:31:07,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2023-11-29 03:31:07,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-29 03:31:07,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:31:07,800 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-29 03:31:07,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:31:07,801 INFO L85 PathProgramCache]: Analyzing trace with hash 206832505, now seen corresponding path program 1 times [2023-11-29 03:31:07,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:31:07,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530637807] [2023-11-29 03:31:07,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:31:07,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:31:07,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:31:07,803 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:31:07,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 03:31:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:31:08,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 107 conjunts are in the unsatisfiable core [2023-11-29 03:31:08,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:31:08,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:31:08,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:31:08,757 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:31:08,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:31:08,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:31:08,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:31:08,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 03:31:08,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:31:09,680 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:31:09,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:31:09,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:31:09,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 03:31:09,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:31:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:31:09,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:31:11,101 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2669 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2023-11-29 03:31:11,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:31:11,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530637807] [2023-11-29 03:31:11,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530637807] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:31:11,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1049866001] [2023-11-29 03:31:11,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:31:11,109 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:31:11,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:31:11,110 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:31:11,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 03:32:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:32:47,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 03:32:47,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:32:47,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:32:47,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:32:47,845 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:32:47,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:32:47,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:32:47,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:32:48,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 03:32:48,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:32:48,645 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:32:48,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:32:48,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:32:48,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:32:48,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:32:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:32:48,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:32:50,000 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3207 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (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$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:32:50,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1049866001] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:32:50,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:32:50,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 03:32:50,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369331968] [2023-11-29 03:32:50,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:32:50,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 03:32:50,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:32:50,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 03:32:50,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-29 03:32:50,007 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-29 03:33:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:33:04,882 INFO L93 Difference]: Finished difference Result 2208 states and 2405 transitions. [2023-11-29 03:33:04,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:33:04,882 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-29 03:33:04,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:33:04,886 INFO L225 Difference]: With dead ends: 2208 [2023-11-29 03:33:04,886 INFO L226 Difference]: Without dead ends: 2208 [2023-11-29 03:33:04,886 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-29 03:33:04,887 INFO L413 NwaCegarLoop]: 706 mSDtfsCounter, 2453 mSDsluCounter, 3180 mSDsCounter, 0 mSdLazyCounter, 7793 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s 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, 14.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:33:04,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2471 Valid, 3886 Invalid, 7830 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [37 Valid, 7793 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2023-11-29 03:33:04,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2023-11-29 03:33:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1458. [2023-11-29 03:33:04,907 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-29 03:33:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1624 transitions. [2023-11-29 03:33:04,911 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1624 transitions. Word has length 103 [2023-11-29 03:33:04,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:33:04,912 INFO L495 AbstractCegarLoop]: Abstraction has 1458 states and 1624 transitions. [2023-11-29 03:33:04,912 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-29 03:33:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1624 transitions. [2023-11-29 03:33:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 03:33:04,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:33:04,922 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:33:04,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 03:33:05,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-29 03:33:05,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:33:05,326 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-29 03:33:05,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:33:05,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1199784399, now seen corresponding path program 1 times [2023-11-29 03:33:05,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:33:05,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397038509] [2023-11-29 03:33:05,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:33:05,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-29 03:33:05,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:33:05,329 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:33:05,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-29 03:33:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:33:06,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 03:33:06,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:33:06,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:33:06,187 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:33:06,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:33:06,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:33:06,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 03:33:07,086 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:33:07,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:33:07,185 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:33:07,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:33:07,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 03:33:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:33:07,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:33:11,334 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 03:33:11,693 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$#4.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-29 03:33:11,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:33:11,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397038509] [2023-11-29 03:33:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397038509] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:33:11,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1726794829] [2023-11-29 03:33:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:33:11,697 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:33:11,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:33:11,697 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:33:11,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 03:33:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:33:14,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 03:33:14,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:33:14,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:33:14,991 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:33:14,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:33:15,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:33:15,672 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:33:15,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 03:33:15,826 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:33:15,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 03:33:15,839 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 03:33:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:33:15,843 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:33:15,860 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4069 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4069) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 03:33:15,873 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4069 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:33:16,289 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-11-29 03:33:16,290 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-29 03:33:16,300 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4069 (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$#4.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_4069)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 03:33:16,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1726794829] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:33:16,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:33:16,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-11-29 03:33:16,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655392819] [2023-11-29 03:33:16,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:33:16,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 03:33:16,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:33:16,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 03:33:16,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=402, Unknown=6, NotChecked=220, Total=702 [2023-11-29 03:33:16,304 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-29 03:33:31,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:33:31,752 INFO L93 Difference]: Finished difference Result 2208 states and 2407 transitions. [2023-11-29 03:33:31,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 03:33:31,752 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-29 03:33:31,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:33:31,757 INFO L225 Difference]: With dead ends: 2208 [2023-11-29 03:33:31,757 INFO L226 Difference]: Without dead ends: 2208 [2023-11-29 03:33:31,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=134, Invalid=692, Unknown=6, NotChecked=290, Total=1122 [2023-11-29 03:33:31,759 INFO L413 NwaCegarLoop]: 694 mSDtfsCounter, 2457 mSDsluCounter, 5960 mSDsCounter, 0 mSdLazyCounter, 7417 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s 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, 15.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:33:31,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2478 Valid, 6654 Invalid, 7476 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 7417 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2023-11-29 03:33:31,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2023-11-29 03:33:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 1457. [2023-11-29 03:33:31,778 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-29 03:33:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1623 transitions. [2023-11-29 03:33:31,788 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1623 transitions. Word has length 105 [2023-11-29 03:33:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:33:31,789 INFO L495 AbstractCegarLoop]: Abstraction has 1457 states and 1623 transitions. [2023-11-29 03:33:31,789 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-29 03:33:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1623 transitions. [2023-11-29 03:33:31,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 03:33:31,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:33:31,791 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:33:31,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-11-29 03:33:32,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 03:33:32,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:33:32,203 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-29 03:33:32,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:33:32,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1199784400, now seen corresponding path program 1 times [2023-11-29 03:33:32,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:33:32,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327936021] [2023-11-29 03:33:32,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:33:32,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:33:32,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:33:32,206 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:33:32,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-29 03:33:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:33:33,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 03:33:33,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:33:33,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:33:33,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:33:33,168 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:33:33,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:33:33,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:33:33,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:33:33,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 03:33:33,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:33:33,974 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:33:33,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:33:33,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:33:34,092 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:33:34,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:33:34,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:33:34,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 03:33:34,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:33:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:33:34,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:33:34,289 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (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)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-11-29 03:33:34,323 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_4569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (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$#4.offset| .cse1 v_ArrVal_4569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_4568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:33:35,636 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$#4.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$#4.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$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4661) (select (select (store |c_#memory_$Pointer$#4.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-29 03:33:35,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:33:35,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327936021] [2023-11-29 03:33:35,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327936021] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:33:35,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1376270644] [2023-11-29 03:33:35,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:33:35,646 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:33:35,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:33:35,647 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:33:35,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 03:33:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:33:39,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 03:33:39,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:33:39,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:33:39,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:33:39,629 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:33:39,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:33:39,636 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 12 treesize of output 14 [2023-11-29 03:33:39,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:33:39,718 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 15 treesize of output 1 [2023-11-29 03:33:39,804 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 17 treesize of output 9 [2023-11-29 03:33:39,868 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 7 treesize of output 3 [2023-11-29 03:33:40,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:33:40,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:33:40,753 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2023-11-29 03:33:40,762 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 27 treesize of output 22 [2023-11-29 03:33:40,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 03:33:40,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:33:40,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:33:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:33:41,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:33:41,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 167 [2023-11-29 03:33:48,651 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5119 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5119))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse1 (select |c_#length| v_arrayElimCell_67))) (or (not (bvule (bvadd .cse0 (_ bv20 32)) .cse1)) (bvule (bvadd (_ bv8 32) (select (select (store .cse2 v_arrayElimCell_67 (store (select .cse2 v_arrayElimCell_67) (bvadd (_ bv16 32) .cse0) .cse3)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) .cse1) (= |c_ULTIMATE.start_main_~user~0#1.base| v_arrayElimCell_67))))) (forall ((v_ArrVal_5119 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5119))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (bvadd (_ bv8 32) (select (select (store .cse7 v_arrayElimCell_67 (store (select .cse7 v_arrayElimCell_67) (bvadd (_ bv16 32) .cse4) .cse3)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (.cse5 (select |c_#length| v_arrayElimCell_67))) (or (not (bvule (bvadd .cse4 (_ bv20 32)) .cse5)) (forall ((v_ArrVal_5071 (_ BitVec 32))) (bvule .cse6 (select |c_#length| v_ArrVal_5071))) (bvule .cse6 .cse5)))))) (forall ((v_ArrVal_5119 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32))) (let ((.cse10 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5119))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (not (bvule (bvadd .cse8 (_ bv20 32)) (select |c_#length| v_arrayElimCell_67))) (let ((.cse9 (select (select (store .cse10 v_arrayElimCell_67 (store (select .cse10 v_arrayElimCell_67) (bvadd (_ bv16 32) .cse8) .cse3)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse9) (bvadd (_ bv8 32) .cse9))))))) (forall ((v_ArrVal_5119 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5119) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse11 (select .cse12 .cse3))) (or (not (bvule (bvadd .cse11 (_ bv20 32)) (select |c_#length| |c_ULTIMATE.start_main_~user~0#1.base|))) (not (= |c_ULTIMATE.start_main_~user~0#1.offset| (bvadd .cse11 (_ bv8 32)))) (forall ((v_ArrVal_5071 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (store .cse12 (bvadd (_ bv16 32) .cse11) .cse3) .cse3)) (select |c_#length| v_ArrVal_5071))))))) (forall ((v_ArrVal_5119 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5119))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~user~0#1.offset| (bvadd .cse13 (_ bv8 32))) (forall ((v_arrayElimCell_67 (_ BitVec 32))) (let ((.cse14 (select |c_#length| v_arrayElimCell_67))) (or (not (bvule (bvadd .cse13 (_ bv20 32)) .cse14)) (bvule (bvadd (_ bv8 32) (select (select (store .cse15 v_arrayElimCell_67 (store (select .cse15 v_arrayElimCell_67) (bvadd (_ bv16 32) .cse13) .cse3)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) .cse14)))))))))) is different from false [2023-11-29 03:33:48,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1376270644] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:33:48,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:33:48,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-11-29 03:33:48,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428630479] [2023-11-29 03:33:48,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:33:48,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 03:33:48,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:33:48,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 03:33:48,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=486, Unknown=4, NotChecked=188, Total=756 [2023-11-29 03:33:48,723 INFO L87 Difference]: Start difference. First operand 1457 states and 1623 transitions. Second operand has 20 states, 17 states have (on average 7.117647058823529) internal successors, (121), 20 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-29 03:35:03,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:35:03,073 INFO L93 Difference]: Finished difference Result 2206 states and 2403 transitions. [2023-11-29 03:35:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:35:03,074 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.117647058823529) internal successors, (121), 20 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-29 03:35:03,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:35:03,078 INFO L225 Difference]: With dead ends: 2206 [2023-11-29 03:35:03,078 INFO L226 Difference]: Without dead ends: 2206 [2023-11-29 03:35:03,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=155, Invalid=849, Unknown=4, NotChecked=252, Total=1260 [2023-11-29 03:35:03,079 INFO L413 NwaCegarLoop]: 495 mSDtfsCounter, 1543 mSDsluCounter, 5302 mSDsCounter, 0 mSdLazyCounter, 14287 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 5797 SdHoareTripleChecker+Invalid, 14310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 14287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:35:03,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 5797 Invalid, 14310 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [23 Valid, 14287 Invalid, 0 Unknown, 0 Unchecked, 72.6s Time] [2023-11-29 03:35:03,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2023-11-29 03:35:03,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 1456. [2023-11-29 03:35:03,098 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-29 03:35:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1622 transitions. [2023-11-29 03:35:03,102 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1622 transitions. Word has length 105 [2023-11-29 03:35:03,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:35:03,102 INFO L495 AbstractCegarLoop]: Abstraction has 1456 states and 1622 transitions. [2023-11-29 03:35:03,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.117647058823529) internal successors, (121), 20 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-29 03:35:03,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1622 transitions. [2023-11-29 03:35:03,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 03:35:03,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:35:03,103 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:35:03,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-11-29 03:35:03,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 03:35:03,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:35:03,504 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-29 03:35:03,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:35:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1943810240, now seen corresponding path program 1 times [2023-11-29 03:35:03,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:35:03,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849921731] [2023-11-29 03:35:03,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:35:03,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:35:03,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:35:03,506 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:35:03,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-29 03:35:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:35:04,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 03:35:04,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:35:04,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:35:05,082 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:35:05,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:35:05,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:35:05,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 03:35:07,485 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:35:07,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:35:07,728 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:35:07,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:35:07,936 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:35:07,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:35:07,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 03:35:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:35:08,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:35:08,792 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5543 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5543) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:35:08,826 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5543 (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$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5542))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5543)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:35:08,864 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5543 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5542))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5543)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:35:09,557 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5589 (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$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5589))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5542)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5543)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:35:09,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:35:09,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849921731] [2023-11-29 03:35:09,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849921731] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:35:09,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1830738798] [2023-11-29 03:35:09,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:35:09,564 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:35:09,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:35:09,565 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:35:09,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 03:35:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:35:14,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 03:35:14,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:35:14,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:35:15,062 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:35:15,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:35:15,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:35:16,844 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:35:16,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 03:35:17,228 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:35:17,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:35:17,492 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:35:17,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 03:35:17,518 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 03:35:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:35:17,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:35:21,709 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6011 (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$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6011))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5543)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:35:24,564 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2023-11-29 03:35:24,565 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-29 03:35:24,589 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6011 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6058 (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$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6058))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6011)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5543)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 03:35:24,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1830738798] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:35:24,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:35:24,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2023-11-29 03:35:24,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656361336] [2023-11-29 03:35:24,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:35:24,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 03:35:24,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:35:24,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 03:35:24,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=519, Unknown=9, NotChecked=306, Total=930 [2023-11-29 03:35:24,596 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-29 03:36:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:36:05,405 INFO L93 Difference]: Finished difference Result 2206 states and 2405 transitions. [2023-11-29 03:36:05,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:36:05,405 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-29 03:36:05,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:36:05,409 INFO L225 Difference]: With dead ends: 2206 [2023-11-29 03:36:05,410 INFO L226 Difference]: Without dead ends: 2206 [2023-11-29 03:36:05,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=172, Invalid=899, Unknown=9, NotChecked=402, Total=1482 [2023-11-29 03:36:05,411 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 2453 mSDsluCounter, 7019 mSDsCounter, 0 mSdLazyCounter, 8731 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2474 SdHoareTripleChecker+Valid, 7712 SdHoareTripleChecker+Invalid, 8791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 8731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:36:05,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2474 Valid, 7712 Invalid, 8791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 8731 Invalid, 0 Unknown, 0 Unchecked, 39.7s Time] [2023-11-29 03:36:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2023-11-29 03:36:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 1455. [2023-11-29 03:36:05,429 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-29 03:36:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1621 transitions. [2023-11-29 03:36:05,431 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1621 transitions. Word has length 107 [2023-11-29 03:36:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:36:05,432 INFO L495 AbstractCegarLoop]: Abstraction has 1455 states and 1621 transitions. [2023-11-29 03:36:05,432 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-29 03:36:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1621 transitions. [2023-11-29 03:36:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 03:36:05,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:36:05,433 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:36:05,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-11-29 03:36:05,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-11-29 03:36:05,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:36:05,834 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-29 03:36:05,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:36:05,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1943810241, now seen corresponding path program 1 times [2023-11-29 03:36:05,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:36:05,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556973829] [2023-11-29 03:36:05,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:05,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:36:05,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:36:05,836 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:36:05,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-11-29 03:36:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:06,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 03:36:06,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:36:06,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:36:07,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 5 [2023-11-29 03:36:07,188 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:36:07,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:36:07,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:36:07,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:36:07,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 03:36:07,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:36:09,194 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:36:09,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:36:09,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:36:09,480 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:36:09,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:36:09,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:36:09,720 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:36:09,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:36:09,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:36:09,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 03:36:09,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:36:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:36:09,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:36:10,167 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6528 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6528) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 03:36:10,220 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_6529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6528 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_6529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_6528) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:36:10,375 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6527 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6526) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6528 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6527))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6526) .cse2 v_ArrVal_6529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6528) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:36:10,477 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6527 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_6526) (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_6527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6528 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_6527))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_6526) .cse3 v_ArrVal_6529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6528) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:36:12,334 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6621 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6621))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6620) .cse1 v_ArrVal_6526) (select (select (store .cse2 .cse1 v_ArrVal_6527) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6529))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6621 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6621))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6527))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6620) .cse4 v_ArrVal_6526) .cse5 v_ArrVal_6529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6528) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 03:36:12,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:36:12,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556973829] [2023-11-29 03:36:12,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556973829] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:36:12,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1873166953] [2023-11-29 03:36:12,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:12,352 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:36:12,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:36:12,353 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:36:12,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 03:36:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:37,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 03:36:37,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:36:37,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:36:38,071 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:36:38,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:36:38,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:36:38,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:36:38,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:36:38,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 03:36:38,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:36:40,170 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:36:40,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:36:40,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:36:40,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 39 [2023-11-29 03:36:40,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:36:40,835 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:36:40,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:36:40,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:36:40,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:36:40,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:36:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:36:40,921 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:36:41,012 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 03:36:41,062 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:36:41,130 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base|)) (.cse4 (bvadd |c_ULTIMATE.start_main_#t~mem35#1.offset| (_ bv16 32))) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7091 (_ BitVec 32)) (v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| (store .cse3 .cse4 v_ArrVal_7091)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7089) .cse0 v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7091 (_ BitVec 32)) (v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7089) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| (store .cse3 .cse4 v_ArrVal_7091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 03:36:41,240 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (select |c_#memory_$Pointer$#4.base| .cse0)) (.cse5 (bvadd (_ bv16 32) (select (select |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (and (forall ((v_ArrVal_7091 (_ BitVec 32)) (v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#4.base| .cse0 (store .cse4 .cse5 v_ArrVal_7091)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_7089) .cse1 v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7091 (_ BitVec 32)) (v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_7089) (select (select (store |c_#memory_$Pointer$#4.base| .cse0 (store .cse4 .cse5 v_ArrVal_7091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse6) (bvadd .cse6 (_ bv12 32))))))))) is different from false [2023-11-29 03:36:43,515 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (_ BitVec 32)) (v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7184))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse0 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7185))) (let ((.cse4 (store .cse5 .cse1 (store (select .cse5 .cse1) (bvadd (_ bv16 32) (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) v_ArrVal_7091)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store .cse0 .cse1 v_ArrVal_7089) .cse2 v_ArrVal_7092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_7093) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_7184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7091 (_ BitVec 32)) (v_ArrVal_7185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7184))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse7 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7185))) (store (store .cse7 .cse8 v_ArrVal_7089) (select (select (store .cse9 .cse8 (store (select .cse9 .cse8) (bvadd (_ bv16 32) (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) v_ArrVal_7091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7092))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv8 32)) (bvadd .cse6 (_ bv12 32))))))) is different from false [2023-11-29 03:36:43,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1873166953] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:36:43,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:36:43,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 03:36:43,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487269282] [2023-11-29 03:36:43,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:36:43,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 03:36:43,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:36:43,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 03:36:43,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 03:36:43,647 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-29 03:37:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:37:18,408 INFO L93 Difference]: Finished difference Result 2204 states and 2401 transitions. [2023-11-29 03:37:18,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:37:18,409 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2023-11-29 03:37:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:37:18,412 INFO L225 Difference]: With dead ends: 2204 [2023-11-29 03:37:18,412 INFO L226 Difference]: Without dead ends: 2204 [2023-11-29 03:37:18,413 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-29 03:37:18,413 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 1527 mSDsluCounter, 3131 mSDsCounter, 0 mSdLazyCounter, 7115 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 3836 SdHoareTripleChecker+Invalid, 7132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 7115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:37:18,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 3836 Invalid, 7132 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [17 Valid, 7115 Invalid, 0 Unknown, 0 Unchecked, 34.0s Time] [2023-11-29 03:37:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2023-11-29 03:37:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1454. [2023-11-29 03:37:18,425 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-29 03:37:18,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1620 transitions. [2023-11-29 03:37:18,427 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1620 transitions. Word has length 107 [2023-11-29 03:37:18,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:37:18,427 INFO L495 AbstractCegarLoop]: Abstraction has 1454 states and 1620 transitions. [2023-11-29 03:37:18,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:37:18,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1620 transitions. [2023-11-29 03:37:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 03:37:18,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:37:18,428 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:37:18,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 03:37:18,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-11-29 03:37:18,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:37:18,828 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-29 03:37:18,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:37:18,829 INFO L85 PathProgramCache]: Analyzing trace with hash -306899572, now seen corresponding path program 1 times [2023-11-29 03:37:18,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:37:18,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353482215] [2023-11-29 03:37:18,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:37:18,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:37:18,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:37:18,831 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:37:18,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-11-29 03:37:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:20,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 03:37:20,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:37:20,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:37:20,499 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:37:20,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:37:20,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:37:20,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 03:37:22,751 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:37:22,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 03:37:23,035 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:37:23,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:37:23,220 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:37:23,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:37:23,425 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:37:23,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:37:23,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 03:37:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:37:23,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:37:27,849 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7625) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 03:37:27,880 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7624 (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$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7624))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7625)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:37:27,911 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7624 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7624))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7625)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:37:27,943 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7623 (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$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7623))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7624)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7625)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:37:27,980 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7623 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7623))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7624)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7625)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:37:28,644 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7671))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7623)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7624)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7625)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:37:28,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:37:28,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353482215] [2023-11-29 03:37:28,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353482215] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:37:28,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [776221905] [2023-11-29 03:37:28,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:37:28,653 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:37:28,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:37:28,653 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:37:28,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 03:37:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:55,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 03:37:55,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:37:55,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:37:55,930 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:37:55,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:37:56,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:37:57,692 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:37:57,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 03:37:58,092 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:37:58,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 36 treesize of output 35 [2023-11-29 03:37:58,344 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:37:58,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 03:37:58,609 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:37:58,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 03:37:58,643 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 03:37:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:37:58,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:38:02,845 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7625 (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$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8109))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7625)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:38:02,875 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7625 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8109))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7625)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:38:02,908 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8108))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8109)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7625)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:38:02,943 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8108 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8108))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8109)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7625)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:38:03,694 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-11-29 03:38:03,694 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-29 03:38:03,720 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8156 (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 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8156))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8108)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8109)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7625)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 03:38:03,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [776221905] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:38:03,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:38:03,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 [2023-11-29 03:38:03,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362401355] [2023-11-29 03:38:03,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:38:03,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 03:38:03,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:38:03,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 03:38:03,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=575, Unknown=13, NotChecked=638, Total=1332 [2023-11-29 03:38:03,729 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-29 03:38:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:38:52,338 INFO L93 Difference]: Finished difference Result 2204 states and 2403 transitions. [2023-11-29 03:38:52,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:38:52,339 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-29 03:38:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:38:52,342 INFO L225 Difference]: With dead ends: 2204 [2023-11-29 03:38:52,342 INFO L226 Difference]: Without dead ends: 2204 [2023-11-29 03:38:52,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=188, Invalid=1033, Unknown=13, NotChecked=836, Total=2070 [2023-11-29 03:38:52,343 INFO L413 NwaCegarLoop]: 692 mSDtfsCounter, 1543 mSDsluCounter, 8690 mSDsCounter, 0 mSdLazyCounter, 10696 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 9382 SdHoareTripleChecker+Invalid, 10736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 10696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:38:52,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 9382 Invalid, 10736 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 10696 Invalid, 0 Unknown, 0 Unchecked, 47.3s Time] [2023-11-29 03:38:52,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2023-11-29 03:38:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1453. [2023-11-29 03:38:52,355 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-29 03:38:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1619 transitions. [2023-11-29 03:38:52,357 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1619 transitions. Word has length 109 [2023-11-29 03:38:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:38:52,357 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 1619 transitions. [2023-11-29 03:38:52,357 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-29 03:38:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1619 transitions. [2023-11-29 03:38:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 03:38:52,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:38:52,358 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:38:52,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-11-29 03:38:52,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 03:38:52,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:38:52,758 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-29 03:38:52,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:38:52,759 INFO L85 PathProgramCache]: Analyzing trace with hash -306899571, now seen corresponding path program 1 times [2023-11-29 03:38:52,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:38:52,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461811501] [2023-11-29 03:38:52,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:38:52,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:38:52,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:38:52,760 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:38:52,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-11-29 03:38:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:38:53,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 03:38:53,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:38:53,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 03:38:54,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 03:38:54,242 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:38:54,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:38:54,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:38:54,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:38:54,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 03:38:54,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:38:56,242 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:38:56,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:38:56,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:38:56,517 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:38:56,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:38:56,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:38:56,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:38:56,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:38:56,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:38:56,961 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:38:56,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:38:56,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:38:57,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 03:38:57,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:38:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:38:57,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:38:57,418 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 03:38:57,469 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_8643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_8644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_8643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 03:38:57,558 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8641 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8641) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8641 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8642))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8641) .cse2 v_ArrVal_8643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:38:57,658 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8641 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_8641) (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_8642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8641 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_8642))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_8641) .cse3 v_ArrVal_8643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:38:57,782 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8639))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8642))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8640) .cse0 v_ArrVal_8641) .cse1 v_ArrVal_8643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8639))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8640) .cse6 v_ArrVal_8641) (select (select (store .cse7 .cse6 v_ArrVal_8642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8643))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 03:38:57,890 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_8639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_8639))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8642))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_8640) .cse1 v_ArrVal_8641) .cse2 v_ArrVal_8643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_8639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_8639))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_8640) .cse7 v_ArrVal_8641) (select (select (store .cse8 .cse7 v_ArrVal_8642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8643))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 03:39:04,176 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8736))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_8639))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8735) .cse1 v_ArrVal_8640) .cse2 v_ArrVal_8641) (select (select (store .cse3 .cse2 v_ArrVal_8642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8643))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8736))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_8639))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_8642))) (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$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8735) .cse6 v_ArrVal_8640) .cse7 v_ArrVal_8641) .cse8 v_ArrVal_8643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_8644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 03:39:04,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:39:04,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461811501] [2023-11-29 03:39:04,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461811501] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:39:04,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1720643723] [2023-11-29 03:39:04,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:39:04,214 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:39:04,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:39:04,215 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:39:04,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1359e30-8f2a-4b85-96c5-12bf2ee6ba06/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process