./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c --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_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/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_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/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_7a15c157-2abd-4474-a1eb-137f8efdf71a/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 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:58:27,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:58:27,951 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-28 23:58:27,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:58:27,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:58:27,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:58:27,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:58:27,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:58:27,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:58:27,986 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:58:27,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:58:27,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:58:27,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:58:27,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:58:27,989 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:58:27,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:58:27,990 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:58:27,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:58:27,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:58:27,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:58:27,992 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:58:27,995 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:58:27,996 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:58:27,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:58:27,997 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:58:27,997 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:58:27,998 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:58:27,998 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:58:27,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:58:27,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:58:27,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:58:28,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:58:28,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:58:28,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:58:28,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:58:28,001 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:58:28,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:58:28,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:58:28,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:58:28,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:58:28,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:58:28,002 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_7a15c157-2abd-4474-a1eb-137f8efdf71a/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_7a15c157-2abd-4474-a1eb-137f8efdf71a/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 -> 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a [2023-11-28 23:58:28,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:58:28,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:58:28,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:58:28,219 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:58:28,220 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:58:28,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2023-11-28 23:58:31,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:58:31,188 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:58:31,188 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2023-11-28 23:58:31,195 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/data/fc395bc4b/9341abd38fca449ca990835a4186d11b/FLAG0102ee9ab [2023-11-28 23:58:31,206 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/data/fc395bc4b/9341abd38fca449ca990835a4186d11b [2023-11-28 23:58:31,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:58:31,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:58:31,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:58:31,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:58:31,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:58:31,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:58:31" (1/1) ... [2023-11-28 23:58:31,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe2176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:31, skipping insertion in model container [2023-11-28 23:58:31,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:58:31" (1/1) ... [2023-11-28 23:58:31,239 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:58:31,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:58:31,394 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-28 23:58:31,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@49df78b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:31, skipping insertion in model container [2023-11-28 23:58:31,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:58:31,396 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-28 23:58:31,398 INFO L158 Benchmark]: Toolchain (without parser) took 186.68ms. Allocated memory is still 257.9MB. Free memory was 220.6MB in the beginning and 210.9MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-28 23:58:31,398 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 140.5MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:58:31,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.14ms. Allocated memory is still 257.9MB. Free memory was 220.6MB in the beginning and 210.9MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-28 23:58:31,400 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.14ms. Allocated memory is still 140.5MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.14ms. Allocated memory is still 257.9MB. Free memory was 220.6MB in the beginning and 210.9MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 99]: 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_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/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_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/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_7a15c157-2abd-4474-a1eb-137f8efdf71a/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 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:58:33,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:58:33,194 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-28 23:58:33,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:58:33,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:58:33,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:58:33,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:58:33,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:58:33,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:58:33,230 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:58:33,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:58:33,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:58:33,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:58:33,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:58:33,232 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:58:33,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:58:33,233 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:58:33,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:58:33,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:58:33,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:58:33,236 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:58:33,236 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:58:33,237 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:58:33,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:58:33,237 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:58:33,238 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 23:58:33,238 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 23:58:33,239 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:58:33,239 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:58:33,239 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:58:33,240 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:58:33,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:58:33,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:58:33,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:58:33,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:58:33,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:58:33,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:58:33,242 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 23:58:33,242 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 23:58:33,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:58:33,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:58:33,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:58:33,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:58:33,243 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 23:58:33,243 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_7a15c157-2abd-4474-a1eb-137f8efdf71a/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_7a15c157-2abd-4474-a1eb-137f8efdf71a/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 -> 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a [2023-11-28 23:58:33,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:58:33,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:58:33,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:58:33,557 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:58:33,558 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:58:33,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2023-11-28 23:58:36,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:58:36,537 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:58:36,537 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2023-11-28 23:58:36,546 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/data/10539cb25/724d6de312994165b750fcc9d5ff32e3/FLAGd8eb9eb6a [2023-11-28 23:58:36,560 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/data/10539cb25/724d6de312994165b750fcc9d5ff32e3 [2023-11-28 23:58:36,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:58:36,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:58:36,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:58:36,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:58:36,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:58:36,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:58:36" (1/1) ... [2023-11-28 23:58:36,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c058f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36, skipping insertion in model container [2023-11-28 23:58:36,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:58:36" (1/1) ... [2023-11-28 23:58:36,597 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:58:36,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:58:36,799 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-28 23:58:36,804 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:58:36,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:58:36,829 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:58:36,864 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:58:36,883 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:58:36,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36 WrapperNode [2023-11-28 23:58:36,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:58:36,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:58:36,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:58:36,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:58:36,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36" (1/1) ... [2023-11-28 23:58:36,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36" (1/1) ... [2023-11-28 23:58:36,939 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2023-11-28 23:58:36,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:58:36,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:58:36,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:58:36,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:58:36,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36" (1/1) ... [2023-11-28 23:58:36,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36" (1/1) ... [2023-11-28 23:58:36,955 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36" (1/1) ... [2023-11-28 23:58:36,971 INFO L175 MemorySlicer]: Split 12 memory accesses to 5 slices as follows [2, 2, 2, 4, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-28 23:58:36,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36" (1/1) ... [2023-11-28 23:58:36,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36" (1/1) ... [2023-11-28 23:58:36,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36" (1/1) ... [2023-11-28 23:58:36,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36" (1/1) ... [2023-11-28 23:58:36,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36" (1/1) ... [2023-11-28 23:58:36,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36" (1/1) ... [2023-11-28 23:58:36,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:58:36,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:58:37,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:58:37,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:58:37,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36" (1/1) ... [2023-11-28 23:58:37,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:58:37,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:58:37,032 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:58:37,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:58:37,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:58:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 23:58:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-28 23:58:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-28 23:58:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-28 23:58:37,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-28 23:58:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:58:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-28 23:58:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-28 23:58:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-28 23:58:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-28 23:58:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-28 23:58:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-28 23:58:37,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-28 23:58:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-28 23:58:37,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-28 23:58:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-28 23:58:37,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-28 23:58:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-28 23:58:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:58:37,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:58:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:58:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-28 23:58:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-28 23:58:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-28 23:58:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-28 23:58:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-28 23:58:37,077 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 23:58:37,201 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:58:37,203 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:58:37,612 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:58:37,845 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:58:37,845 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-28 23:58:37,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:58:37 BoogieIcfgContainer [2023-11-28 23:58:37,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:58:37,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:58:37,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:58:37,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:58:37,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:58:36" (1/3) ... [2023-11-28 23:58:37,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22881e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:58:37, skipping insertion in model container [2023-11-28 23:58:37,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:58:36" (2/3) ... [2023-11-28 23:58:37,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22881e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:58:37, skipping insertion in model container [2023-11-28 23:58:37,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:58:37" (3/3) ... [2023-11-28 23:58:37,855 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2023-11-28 23:58:37,873 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:58:37,873 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2023-11-28 23:58:37,873 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 23:58:37,937 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-28 23:58:37,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 61 transitions, 143 flow [2023-11-28 23:58:38,004 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2023-11-28 23:58:38,005 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-28 23:58:38,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 58 events. 4/58 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 110 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2023-11-28 23:58:38,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 61 transitions, 143 flow [2023-11-28 23:58:38,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 57 transitions, 132 flow [2023-11-28 23:58:38,023 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:58:38,030 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;@5bd3b631, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:58:38,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-11-28 23:58:38,035 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:58:38,035 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-11-28 23:58:38,035 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:58:38,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:58:38,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-28 23:58:38,037 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:58:38,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:38,042 INFO L85 PathProgramCache]: Analyzing trace with hash 419722, now seen corresponding path program 1 times [2023-11-28 23:58:38,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:38,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779940092] [2023-11-28 23:58:38,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:38,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:38,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:38,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:58:38,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-28 23:58:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:38,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:58:38,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:38,263 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 11 treesize of output 7 [2023-11-28 23:58:38,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-28 23:58:38,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-28 23:58:38,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:38,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-28 23:58:38,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-28 23:58:38,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-28 23:58:38,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:38,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,403 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 1 [2023-11-28 23:58:38,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:38,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,418 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 1 [2023-11-28 23:58:38,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:38,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:38,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-28 23:58:38,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,462 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 1 [2023-11-28 23:58:38,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:38,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:38,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,484 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 1 [2023-11-28 23:58:38,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:38,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,501 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 1 [2023-11-28 23:58:38,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,508 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 1 [2023-11-28 23:58:38,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:38,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:38,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:38,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-28 23:58:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:58:38,560 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:58:38,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:38,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779940092] [2023-11-28 23:58:38,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779940092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:58:38,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:58:38,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:58:38,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418443494] [2023-11-28 23:58:38,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:58:38,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:58:38,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:38,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:58:38,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:58:38,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-28 23:58:38,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:38,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:58:38,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-28 23:58:38,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:58:38,903 INFO L124 PetriNetUnfolderBase]: 200/461 cut-off events. [2023-11-28 23:58:38,903 INFO L125 PetriNetUnfolderBase]: For 53/54 co-relation queries the response was YES. [2023-11-28 23:58:38,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 461 events. 200/461 cut-off events. For 53/54 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2178 event pairs, 124 based on Foata normal form. 1/361 useless extension candidates. Maximal degree in co-relation 711. Up to 293 conditions per place. [2023-11-28 23:58:38,912 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 21 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-28 23:58:38,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 172 flow [2023-11-28 23:58:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:58:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:58:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2023-11-28 23:58:38,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7103825136612022 [2023-11-28 23:58:38,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 130 transitions. [2023-11-28 23:58:38,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 130 transitions. [2023-11-28 23:58:38,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:38,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 130 transitions. [2023-11-28 23:58:38,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:38,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:38,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:38,938 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 132 flow. Second operand 3 states and 130 transitions. [2023-11-28 23:58:38,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 172 flow [2023-11-28 23:58:38,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 160 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-28 23:58:38,945 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 118 flow [2023-11-28 23:58:38,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2023-11-28 23:58:38,951 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2023-11-28 23:58:38,951 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 118 flow [2023-11-28 23:58:38,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:38,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:58:38,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-28 23:58:38,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-28 23:58:39,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:39,153 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:58:39,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:39,154 INFO L85 PathProgramCache]: Analyzing trace with hash 419723, now seen corresponding path program 1 times [2023-11-28 23:58:39,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:39,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327019626] [2023-11-28 23:58:39,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:39,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:39,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:39,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:58:39,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-28 23:58:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:39,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-28 23:58:39,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:39,257 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 13 treesize of output 7 [2023-11-28 23:58:39,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,270 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 8 treesize of output 1 [2023-11-28 23:58:39,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:39,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,291 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 8 treesize of output 1 [2023-11-28 23:58:39,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:39,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:39,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:39,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:39,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:39,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,381 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 8 treesize of output 1 [2023-11-28 23:58:39,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:39,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,401 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 8 treesize of output 1 [2023-11-28 23:58:39,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:39,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:39,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:39,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-28 23:58:39,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:39,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:39,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:39,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,555 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 8 treesize of output 1 [2023-11-28 23:58:39,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:39,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:39,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:39,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:39,607 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 8 treesize of output 1 [2023-11-28 23:58:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:58:39,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:58:39,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:39,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327019626] [2023-11-28 23:58:39,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327019626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:58:39,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:58:39,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:58:39,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342413849] [2023-11-28 23:58:39,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:58:39,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:58:39,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:39,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:58:39,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:58:39,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-28 23:58:39,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:39,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:58:39,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-28 23:58:39,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:58:40,190 INFO L124 PetriNetUnfolderBase]: 201/464 cut-off events. [2023-11-28 23:58:40,190 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2023-11-28 23:58:40,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 464 events. 201/464 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2191 event pairs, 124 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 760. Up to 298 conditions per place. [2023-11-28 23:58:40,197 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 23 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2023-11-28 23:58:40,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 57 transitions, 180 flow [2023-11-28 23:58:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:58:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 23:58:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2023-11-28 23:58:40,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2023-11-28 23:58:40,200 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 168 transitions. [2023-11-28 23:58:40,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 168 transitions. [2023-11-28 23:58:40,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:40,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 168 transitions. [2023-11-28 23:58:40,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:40,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:40,205 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:40,205 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 118 flow. Second operand 4 states and 168 transitions. [2023-11-28 23:58:40,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 57 transitions, 180 flow [2023-11-28 23:58:40,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 57 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:58:40,208 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 141 flow [2023-11-28 23:58:40,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2023-11-28 23:58:40,209 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -4 predicate places. [2023-11-28 23:58:40,209 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 141 flow [2023-11-28 23:58:40,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:40,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:58:40,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-28 23:58:40,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-28 23:58:40,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:40,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:58:40,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash 419790, now seen corresponding path program 1 times [2023-11-28 23:58:40,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:40,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96549070] [2023-11-28 23:58:40,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:40,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:40,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:40,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:58:40,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-28 23:58:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:40,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-28 23:58:40,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:40,557 INFO L349 Elim1Store]: treesize reduction 103, result has 12.7 percent of original size [2023-11-28 23:58:40,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 40 [2023-11-28 23:58:40,609 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-11-28 23:58:40,610 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 4 case distinctions, treesize of input 35 treesize of output 40 [2023-11-28 23:58:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:58:40,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:58:40,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:40,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96549070] [2023-11-28 23:58:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96549070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:58:40,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:58:40,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:58:40,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081084229] [2023-11-28 23:58:40,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:58:40,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:58:40,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:40,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:58:40,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:58:40,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2023-11-28 23:58:40,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:40,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:58:40,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2023-11-28 23:58:40,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:58:41,061 INFO L124 PetriNetUnfolderBase]: 201/445 cut-off events. [2023-11-28 23:58:41,062 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2023-11-28 23:58:41,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 445 events. 201/445 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1960 event pairs, 124 based on Foata normal form. 28/391 useless extension candidates. Maximal degree in co-relation 748. Up to 298 conditions per place. [2023-11-28 23:58:41,067 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 25 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-11-28 23:58:41,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 189 flow [2023-11-28 23:58:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:58:41,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:58:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-28 23:58:41,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6939890710382514 [2023-11-28 23:58:41,069 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-28 23:58:41,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-28 23:58:41,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:41,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-28 23:58:41,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:41,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:41,072 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:41,073 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 141 flow. Second operand 3 states and 127 transitions. [2023-11-28 23:58:41,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 189 flow [2023-11-28 23:58:41,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 55 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:58:41,075 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 136 flow [2023-11-28 23:58:41,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2023-11-28 23:58:41,076 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -5 predicate places. [2023-11-28 23:58:41,077 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 136 flow [2023-11-28 23:58:41,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:41,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:58:41,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-28 23:58:41,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-28 23:58:41,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:41,278 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:58:41,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:41,279 INFO L85 PathProgramCache]: Analyzing trace with hash 419791, now seen corresponding path program 1 times [2023-11-28 23:58:41,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:41,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554572390] [2023-11-28 23:58:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:41,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:41,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:41,281 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:58:41,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-28 23:58:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:41,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-28 23:58:41,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:41,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-28 23:58:41,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-28 23:58:41,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,437 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 11 treesize of output 5 [2023-11-28 23:58:41,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-11-28 23:58:41,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,474 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 11 treesize of output 5 [2023-11-28 23:58:41,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-11-28 23:58:41,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-28 23:58:41,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-28 23:58:41,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2023-11-28 23:58:41,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2023-11-28 23:58:41,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-28 23:58:41,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:41,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-28 23:58:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:58:41,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:58:41,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:41,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554572390] [2023-11-28 23:58:41,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554572390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:58:41,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:58:41,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:58:41,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593621040] [2023-11-28 23:58:41,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:58:41,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:58:41,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:41,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:58:41,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:58:41,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2023-11-28 23:58:41,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:41,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:58:41,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2023-11-28 23:58:41,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:58:41,953 INFO L124 PetriNetUnfolderBase]: 201/426 cut-off events. [2023-11-28 23:58:41,953 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2023-11-28 23:58:41,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 426 events. 201/426 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1754 event pairs, 124 based on Foata normal form. 28/391 useless extension candidates. Maximal degree in co-relation 743. Up to 298 conditions per place. [2023-11-28 23:58:41,957 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 25 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-11-28 23:58:41,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 184 flow [2023-11-28 23:58:41,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:58:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:58:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-28 23:58:41,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6939890710382514 [2023-11-28 23:58:41,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-28 23:58:41,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-28 23:58:41,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:41,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-28 23:58:41,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:41,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:41,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:41,964 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 136 flow. Second operand 3 states and 127 transitions. [2023-11-28 23:58:41,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 184 flow [2023-11-28 23:58:41,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 53 transitions, 183 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:58:41,967 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 133 flow [2023-11-28 23:58:41,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2023-11-28 23:58:41,968 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -6 predicate places. [2023-11-28 23:58:41,968 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 133 flow [2023-11-28 23:58:41,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:41,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:58:41,968 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2023-11-28 23:58:41,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-28 23:58:42,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:42,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:58:42,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash 403367023, now seen corresponding path program 1 times [2023-11-28 23:58:42,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:42,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794508347] [2023-11-28 23:58:42,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:42,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:42,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:42,172 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:58:42,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-28 23:58:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:42,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-28 23:58:42,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:42,261 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 13 treesize of output 7 [2023-11-28 23:58:42,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:42,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:42,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,300 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 8 treesize of output 1 [2023-11-28 23:58:42,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,308 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 8 treesize of output 1 [2023-11-28 23:58:42,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:42,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:42,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:42,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:42,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,366 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 8 treesize of output 1 [2023-11-28 23:58:42,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,382 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 8 treesize of output 1 [2023-11-28 23:58:42,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:42,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,401 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 8 treesize of output 1 [2023-11-28 23:58:42,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:42,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:42,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:42,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,447 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 8 treesize of output 1 [2023-11-28 23:58:42,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:42,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:42,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-28 23:58:42,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:42,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:42,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:42,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:42,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:58:42,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:58:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:58:43,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:43,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794508347] [2023-11-28 23:58:43,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794508347] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:58:43,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:58:43,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-11-28 23:58:43,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9336051] [2023-11-28 23:58:43,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:58:43,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 23:58:43,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:43,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 23:58:43,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-28 23:58:44,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-28 23:58:44,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 133 flow. Second operand has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:44,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:58:44,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-28 23:58:44,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:58:45,080 INFO L124 PetriNetUnfolderBase]: 204/435 cut-off events. [2023-11-28 23:58:45,080 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2023-11-28 23:58:45,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 435 events. 204/435 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1813 event pairs, 124 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 771. Up to 301 conditions per place. [2023-11-28 23:58:45,083 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 23 selfloop transitions, 13 changer transitions 0/62 dead transitions. [2023-11-28 23:58:45,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 241 flow [2023-11-28 23:58:45,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 23:58:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-28 23:58:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 389 transitions. [2023-11-28 23:58:45,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6377049180327868 [2023-11-28 23:58:45,086 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 389 transitions. [2023-11-28 23:58:45,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 389 transitions. [2023-11-28 23:58:45,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:45,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 389 transitions. [2023-11-28 23:58:45,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 38.9) internal successors, (389), 10 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:45,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 61.0) internal successors, (671), 11 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:45,091 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 61.0) internal successors, (671), 11 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:45,092 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 133 flow. Second operand 10 states and 389 transitions. [2023-11-28 23:58:45,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 241 flow [2023-11-28 23:58:45,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:58:45,094 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 212 flow [2023-11-28 23:58:45,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=212, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2023-11-28 23:58:45,095 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 5 predicate places. [2023-11-28 23:58:45,095 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 212 flow [2023-11-28 23:58:45,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:45,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:58:45,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-28 23:58:45,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-28 23:58:45,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:45,297 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:58:45,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash -378523864, now seen corresponding path program 1 times [2023-11-28 23:58:45,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:45,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069417285] [2023-11-28 23:58:45,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:45,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:45,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:45,299 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:58:45,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-28 23:58:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:45,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 23:58:45,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:45,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,404 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 11 treesize of output 5 [2023-11-28 23:58:45,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-28 23:58:45,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-28 23:58:45,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-28 23:58:45,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,514 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 11 treesize of output 5 [2023-11-28 23:58:45,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2023-11-28 23:58:45,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-28 23:58:45,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-28 23:58:45,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-11-28 23:58:45,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,633 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 11 treesize of output 5 [2023-11-28 23:58:45,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-11-28 23:58:45,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:45,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-28 23:58:45,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-28 23:58:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:58:45,761 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:58:45,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:45,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069417285] [2023-11-28 23:58:45,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069417285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:58:45,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:58:45,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:58:45,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227077593] [2023-11-28 23:58:45,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:58:45,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:58:45,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:45,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:58:45,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:58:45,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2023-11-28 23:58:45,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:45,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:58:45,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2023-11-28 23:58:45,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:58:46,015 INFO L124 PetriNetUnfolderBase]: 204/428 cut-off events. [2023-11-28 23:58:46,015 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2023-11-28 23:58:46,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 428 events. 204/428 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1748 event pairs, 124 based on Foata normal form. 9/381 useless extension candidates. Maximal degree in co-relation 784. Up to 307 conditions per place. [2023-11-28 23:58:46,019 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 34 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2023-11-28 23:58:46,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 278 flow [2023-11-28 23:58:46,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:58:46,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:58:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-28 23:58:46,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6939890710382514 [2023-11-28 23:58:46,021 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-28 23:58:46,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-28 23:58:46,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:46,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-28 23:58:46,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:46,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:46,023 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:46,023 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 212 flow. Second operand 3 states and 127 transitions. [2023-11-28 23:58:46,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 278 flow [2023-11-28 23:58:46,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 248 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-28 23:58:46,026 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 180 flow [2023-11-28 23:58:46,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2023-11-28 23:58:46,027 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2023-11-28 23:58:46,028 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 180 flow [2023-11-28 23:58:46,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:46,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:58:46,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-28 23:58:46,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-28 23:58:46,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:46,231 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:58:46,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:46,232 INFO L85 PathProgramCache]: Analyzing trace with hash -378523865, now seen corresponding path program 1 times [2023-11-28 23:58:46,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:46,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037120545] [2023-11-28 23:58:46,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:46,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:46,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:46,233 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:58:46,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-28 23:58:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:46,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:58:46,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:46,311 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:46,311 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 1 case distinctions, treesize of input 17 treesize of output 22 [2023-11-28 23:58:46,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:46,333 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-28 23:58:46,334 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 1 case distinctions, treesize of input 24 treesize of output 22 [2023-11-28 23:58:46,355 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-28 23:58:46,355 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 1 case distinctions, treesize of input 24 treesize of output 22 [2023-11-28 23:58:46,370 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:46,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-11-28 23:58:46,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:46,398 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:46,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 22 [2023-11-28 23:58:46,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:46,442 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-28 23:58:46,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2023-11-28 23:58:46,470 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-28 23:58:46,470 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 1 case distinctions, treesize of input 22 treesize of output 22 [2023-11-28 23:58:46,488 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:46,488 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 1 case distinctions, treesize of input 17 treesize of output 22 [2023-11-28 23:58:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:58:46,660 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:58:46,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:46,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037120545] [2023-11-28 23:58:46,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037120545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:58:46,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:58:46,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:58:46,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544537709] [2023-11-28 23:58:46,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:58:46,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:58:46,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:46,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:58:46,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:58:46,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 61 [2023-11-28 23:58:46,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:46,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:58:46,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 61 [2023-11-28 23:58:46,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:58:46,884 INFO L124 PetriNetUnfolderBase]: 225/448 cut-off events. [2023-11-28 23:58:46,884 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-28 23:58:46,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 448 events. 225/448 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1738 event pairs, 138 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 823. Up to 340 conditions per place. [2023-11-28 23:58:46,887 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 36 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2023-11-28 23:58:46,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 250 flow [2023-11-28 23:58:46,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:58:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:58:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2023-11-28 23:58:46,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2023-11-28 23:58:46,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 123 transitions. [2023-11-28 23:58:46,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 123 transitions. [2023-11-28 23:58:46,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:46,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 123 transitions. [2023-11-28 23:58:46,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:46,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:46,891 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:46,891 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 180 flow. Second operand 3 states and 123 transitions. [2023-11-28 23:58:46,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 58 transitions, 250 flow [2023-11-28 23:58:46,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 58 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:58:46,894 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 177 flow [2023-11-28 23:58:46,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-11-28 23:58:46,895 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2023-11-28 23:58:46,895 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 177 flow [2023-11-28 23:58:46,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:46,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:58:46,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:58:46,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-28 23:58:47,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:47,099 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:58:47,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1150703612, now seen corresponding path program 1 times [2023-11-28 23:58:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:47,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511449572] [2023-11-28 23:58:47,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:47,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:47,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:47,101 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:58:47,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-28 23:58:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:47,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:58:47,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:47,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2023-11-28 23:58:47,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:47,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:47,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,186 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 1 [2023-11-28 23:58:47,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,191 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 1 [2023-11-28 23:58:47,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:47,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,202 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 1 [2023-11-28 23:58:47,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:47,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,212 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 1 [2023-11-28 23:58:47,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:47,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:47,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-28 23:58:47,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,241 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 1 [2023-11-28 23:58:47,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:47,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:47,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-28 23:58:47,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:47,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,276 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 1 [2023-11-28 23:58:47,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-28 23:58:47,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-28 23:58:47,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-28 23:58:47,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:47,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:47,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-28 23:58:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:58:47,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:58:47,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:47,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511449572] [2023-11-28 23:58:47,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511449572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:58:47,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:58:47,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:58:47,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875133280] [2023-11-28 23:58:47,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:58:47,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:58:47,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:47,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:58:47,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:58:47,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 61 [2023-11-28 23:58:47,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:47,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:58:47,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 61 [2023-11-28 23:58:47,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:58:47,598 INFO L124 PetriNetUnfolderBase]: 204/400 cut-off events. [2023-11-28 23:58:47,599 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2023-11-28 23:58:47,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 400 events. 204/400 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1482 event pairs, 124 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 742. Up to 296 conditions per place. [2023-11-28 23:58:47,601 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 29 selfloop transitions, 6 changer transitions 0/55 dead transitions. [2023-11-28 23:58:47,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 241 flow [2023-11-28 23:58:47,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:58:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 23:58:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2023-11-28 23:58:47,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6311475409836066 [2023-11-28 23:58:47,603 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 154 transitions. [2023-11-28 23:58:47,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 154 transitions. [2023-11-28 23:58:47,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:47,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 154 transitions. [2023-11-28 23:58:47,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:47,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:47,605 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:47,605 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 177 flow. Second operand 4 states and 154 transitions. [2023-11-28 23:58:47,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 241 flow [2023-11-28 23:58:47,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 55 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:58:47,608 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 182 flow [2023-11-28 23:58:47,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2023-11-28 23:58:47,609 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 0 predicate places. [2023-11-28 23:58:47,609 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 182 flow [2023-11-28 23:58:47,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:47,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:58:47,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:58:47,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-28 23:58:47,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:47,812 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:58:47,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:47,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1150703613, now seen corresponding path program 1 times [2023-11-28 23:58:47,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:47,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299511324] [2023-11-28 23:58:47,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:47,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:47,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:47,814 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:58:47,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-28 23:58:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:47,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-28 23:58:47,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:47,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-28 23:58:47,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:47,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:47,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-28 23:58:47,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:47,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:47,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:47,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,987 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 8 treesize of output 1 [2023-11-28 23:58:47,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:47,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:48,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,001 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 8 treesize of output 1 [2023-11-28 23:58:48,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:48,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:48,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:48,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:48,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:48,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,059 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 8 treesize of output 1 [2023-11-28 23:58:48,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:48,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,073 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 8 treesize of output 1 [2023-11-28 23:58:48,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:48,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,088 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 8 treesize of output 1 [2023-11-28 23:58:48,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:48,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,102 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 8 treesize of output 1 [2023-11-28 23:58:48,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:48,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:48,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:58:48,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:58:48,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:48,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299511324] [2023-11-28 23:58:48,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299511324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:58:48,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:58:48,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:58:48,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033807965] [2023-11-28 23:58:48,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:58:48,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:58:48,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:48,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:58:48,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:58:48,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2023-11-28 23:58:48,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:48,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:58:48,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2023-11-28 23:58:48,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:58:49,091 INFO L124 PetriNetUnfolderBase]: 514/872 cut-off events. [2023-11-28 23:58:49,091 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2023-11-28 23:58:49,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 872 events. 514/872 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3787 event pairs, 214 based on Foata normal form. 0/758 useless extension candidates. Maximal degree in co-relation 1671. Up to 492 conditions per place. [2023-11-28 23:58:49,098 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 51 selfloop transitions, 12 changer transitions 0/81 dead transitions. [2023-11-28 23:58:49,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 364 flow [2023-11-28 23:58:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:58:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:58:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 257 transitions. [2023-11-28 23:58:49,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7021857923497268 [2023-11-28 23:58:49,101 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 257 transitions. [2023-11-28 23:58:49,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 257 transitions. [2023-11-28 23:58:49,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:49,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 257 transitions. [2023-11-28 23:58:49,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:49,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 61.0) internal successors, (427), 7 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:49,104 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 61.0) internal successors, (427), 7 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:49,104 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 182 flow. Second operand 6 states and 257 transitions. [2023-11-28 23:58:49,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 364 flow [2023-11-28 23:58:49,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:58:49,107 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 232 flow [2023-11-28 23:58:49,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2023-11-28 23:58:49,108 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 5 predicate places. [2023-11-28 23:58:49,108 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 232 flow [2023-11-28 23:58:49,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:49,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:58:49,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:58:49,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-28 23:58:49,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:49,309 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:58:49,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:49,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1980076281, now seen corresponding path program 1 times [2023-11-28 23:58:49,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:49,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633646180] [2023-11-28 23:58:49,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:49,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:49,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:49,311 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:58:49,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-28 23:58:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:49,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:58:49,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:49,412 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:49,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-28 23:58:49,429 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:49,430 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-28 23:58:49,444 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:49,444 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-28 23:58:49,466 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:49,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-28 23:58:49,482 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:49,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-28 23:58:49,496 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:49,496 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-28 23:58:49,512 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:49,512 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-28 23:58:49,534 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:49,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-28 23:58:49,551 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:49,552 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-28 23:58:49,573 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:49,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-28 23:58:49,598 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:49,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2023-11-28 23:58:49,617 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 23:58:49,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-28 23:58:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:58:49,759 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:58:49,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:49,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633646180] [2023-11-28 23:58:49,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633646180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:58:49,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:58:49,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:58:49,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945326279] [2023-11-28 23:58:49,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:58:49,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:58:49,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:49,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:58:49,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:58:49,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 61 [2023-11-28 23:58:49,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:49,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:58:49,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 61 [2023-11-28 23:58:49,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:58:50,010 INFO L124 PetriNetUnfolderBase]: 486/838 cut-off events. [2023-11-28 23:58:50,011 INFO L125 PetriNetUnfolderBase]: For 479/619 co-relation queries the response was YES. [2023-11-28 23:58:50,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 838 events. 486/838 cut-off events. For 479/619 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3659 event pairs, 254 based on Foata normal form. 52/835 useless extension candidates. Maximal degree in co-relation 2057. Up to 693 conditions per place. [2023-11-28 23:58:50,017 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 40 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2023-11-28 23:58:50,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 58 transitions, 310 flow [2023-11-28 23:58:50,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:58:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:58:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2023-11-28 23:58:50,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2023-11-28 23:58:50,019 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 123 transitions. [2023-11-28 23:58:50,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 123 transitions. [2023-11-28 23:58:50,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:50,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 123 transitions. [2023-11-28 23:58:50,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:50,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:50,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:50,020 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 232 flow. Second operand 3 states and 123 transitions. [2023-11-28 23:58:50,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 58 transitions, 310 flow [2023-11-28 23:58:50,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 58 transitions, 295 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 23:58:50,022 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 215 flow [2023-11-28 23:58:50,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2023-11-28 23:58:50,023 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2023-11-28 23:58:50,024 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 215 flow [2023-11-28 23:58:50,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:50,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:58:50,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:58:50,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-28 23:58:50,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:50,225 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:58:50,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:50,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1980076282, now seen corresponding path program 1 times [2023-11-28 23:58:50,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:50,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659230467] [2023-11-28 23:58:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:50,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:50,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:50,227 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:58:50,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-28 23:58:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:50,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 23:58:50,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:50,344 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 11 treesize of output 5 [2023-11-28 23:58:50,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:50,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-28 23:58:50,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:50,389 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:58:50,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,394 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:58:50,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,405 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:58:50,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,416 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:58:50,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,422 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:58:50,427 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 23:58:50,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-28 23:58:50,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:50,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-28 23:58:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:58:50,489 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:58:50,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:50,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659230467] [2023-11-28 23:58:50,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659230467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:58:50,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:58:50,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:58:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113146786] [2023-11-28 23:58:50,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:58:50,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:58:50,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:50,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:58:50,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:58:50,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2023-11-28 23:58:50,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:50,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:58:50,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2023-11-28 23:58:50,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:58:50,740 INFO L124 PetriNetUnfolderBase]: 445/790 cut-off events. [2023-11-28 23:58:50,740 INFO L125 PetriNetUnfolderBase]: For 386/512 co-relation queries the response was YES. [2023-11-28 23:58:50,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 790 events. 445/790 cut-off events. For 386/512 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3600 event pairs, 229 based on Foata normal form. 66/806 useless extension candidates. Maximal degree in co-relation 1829. Up to 630 conditions per place. [2023-11-28 23:58:50,745 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 38 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2023-11-28 23:58:50,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 56 transitions, 289 flow [2023-11-28 23:58:50,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:58:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:58:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-28 23:58:50,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6939890710382514 [2023-11-28 23:58:50,747 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-28 23:58:50,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-28 23:58:50,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:50,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-28 23:58:50,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:50,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:50,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:50,749 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 215 flow. Second operand 3 states and 127 transitions. [2023-11-28 23:58:50,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 56 transitions, 289 flow [2023-11-28 23:58:50,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 56 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:58:50,751 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 212 flow [2023-11-28 23:58:50,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2023-11-28 23:58:50,752 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 1 predicate places. [2023-11-28 23:58:50,752 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 212 flow [2023-11-28 23:58:50,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:50,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:58:50,752 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:58:50,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-28 23:58:50,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:50,953 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:58:50,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:50,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2019591777, now seen corresponding path program 1 times [2023-11-28 23:58:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:50,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382578831] [2023-11-28 23:58:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:50,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:50,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:50,955 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:58:50,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-28 23:58:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:51,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-28 23:58:51,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:51,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-28 23:58:51,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:51,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-28 23:58:51,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:51,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,064 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 8 treesize of output 1 [2023-11-28 23:58:51,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:51,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:51,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:51,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:51,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:51,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-28 23:58:51,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:51,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,171 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 8 treesize of output 1 [2023-11-28 23:58:51,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:51,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:51,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,192 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 8 treesize of output 1 [2023-11-28 23:58:51,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:51,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:51,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:51,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:51,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-28 23:58:51,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:51,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:51,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:51,266 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 8 treesize of output 1 [2023-11-28 23:58:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:58:51,391 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:58:51,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:51,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382578831] [2023-11-28 23:58:51,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382578831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:58:51,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:58:51,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:58:51,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969028768] [2023-11-28 23:58:51,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:58:51,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:58:51,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:51,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:58:51,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:58:51,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 61 [2023-11-28 23:58:51,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:51,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:58:51,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 61 [2023-11-28 23:58:51,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:58:51,984 INFO L124 PetriNetUnfolderBase]: 568/1084 cut-off events. [2023-11-28 23:58:51,984 INFO L125 PetriNetUnfolderBase]: For 563/738 co-relation queries the response was YES. [2023-11-28 23:58:51,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2427 conditions, 1084 events. 568/1084 cut-off events. For 563/738 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5630 event pairs, 304 based on Foata normal form. 171/1230 useless extension candidates. Maximal degree in co-relation 2408. Up to 628 conditions per place. [2023-11-28 23:58:51,993 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 59 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2023-11-28 23:58:51,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 402 flow [2023-11-28 23:58:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:58:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:58:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2023-11-28 23:58:51,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7737704918032787 [2023-11-28 23:58:51,995 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 236 transitions. [2023-11-28 23:58:51,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 236 transitions. [2023-11-28 23:58:51,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:51,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 236 transitions. [2023-11-28 23:58:51,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:51,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:51,997 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:51,997 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 212 flow. Second operand 5 states and 236 transitions. [2023-11-28 23:58:51,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 402 flow [2023-11-28 23:58:51,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 81 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:58:52,000 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 252 flow [2023-11-28 23:58:52,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-28 23:58:52,001 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 6 predicate places. [2023-11-28 23:58:52,001 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 252 flow [2023-11-28 23:58:52,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:52,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:58:52,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:58:52,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-28 23:58:52,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:52,204 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:58:52,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:52,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1252832152, now seen corresponding path program 1 times [2023-11-28 23:58:52,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:52,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755821224] [2023-11-28 23:58:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:52,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-28 23:58:52,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:52,206 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:58:52,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-28 23:58:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:52,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-28 23:58:52,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:52,284 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 13 treesize of output 7 [2023-11-28 23:58:52,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,291 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 8 treesize of output 1 [2023-11-28 23:58:52,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:52,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:52,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:52,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,326 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 8 treesize of output 1 [2023-11-28 23:58:52,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:52,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,338 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 8 treesize of output 1 [2023-11-28 23:58:52,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:52,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:52,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:52,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,372 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 8 treesize of output 1 [2023-11-28 23:58:52,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:52,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,385 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 8 treesize of output 1 [2023-11-28 23:58:52,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:52,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,397 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 8 treesize of output 1 [2023-11-28 23:58:52,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:52,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:52,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:52,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:52,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:52,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:52,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:52,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:52,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-28 23:58:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:58:52,700 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:58:52,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755821224] [2023-11-28 23:58:52,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755821224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:58:52,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:58:52,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:58:52,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290798193] [2023-11-28 23:58:52,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:58:52,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:58:52,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:52,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:58:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:58:53,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2023-11-28 23:58:53,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:53,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:58:53,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2023-11-28 23:58:53,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:58:53,732 INFO L124 PetriNetUnfolderBase]: 1265/2042 cut-off events. [2023-11-28 23:58:53,732 INFO L125 PetriNetUnfolderBase]: For 2464/2762 co-relation queries the response was YES. [2023-11-28 23:58:53,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5662 conditions, 2042 events. 1265/2042 cut-off events. For 2464/2762 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10066 event pairs, 384 based on Foata normal form. 198/2011 useless extension candidates. Maximal degree in co-relation 5640. Up to 1184 conditions per place. [2023-11-28 23:58:53,746 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 63 selfloop transitions, 16 changer transitions 0/94 dead transitions. [2023-11-28 23:58:53,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 94 transitions, 582 flow [2023-11-28 23:58:53,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:58:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:58:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 255 transitions. [2023-11-28 23:58:53,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6967213114754098 [2023-11-28 23:58:53,748 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 255 transitions. [2023-11-28 23:58:53,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 255 transitions. [2023-11-28 23:58:53,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:58:53,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 255 transitions. [2023-11-28 23:58:53,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:53,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 61.0) internal successors, (427), 7 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:53,750 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 61.0) internal successors, (427), 7 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:53,750 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 252 flow. Second operand 6 states and 255 transitions. [2023-11-28 23:58:53,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 94 transitions, 582 flow [2023-11-28 23:58:53,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 94 transitions, 577 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:58:53,753 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 360 flow [2023-11-28 23:58:53,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2023-11-28 23:58:53,754 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 11 predicate places. [2023-11-28 23:58:53,754 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 360 flow [2023-11-28 23:58:53,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:53,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:58:53,755 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:58:53,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-28 23:58:53,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:53,955 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:58:53,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:58:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash 522504261, now seen corresponding path program 1 times [2023-11-28 23:58:53,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:58:53,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912864443] [2023-11-28 23:58:53,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:58:53,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:58:53,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:58:53,957 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:58:53,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-28 23:58:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:58:54,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-28 23:58:54,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:58:54,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-28 23:58:54,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:54,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:54,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:54,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,078 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 8 treesize of output 1 [2023-11-28 23:58:54,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:54,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:54,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-28 23:58:54,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:54,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:54,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:54,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:54,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,178 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 8 treesize of output 1 [2023-11-28 23:58:54,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:54,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:54,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:54,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,222 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 8 treesize of output 1 [2023-11-28 23:58:54,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:54,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:54,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:58:54,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,257 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 8 treesize of output 1 [2023-11-28 23:58:54,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:54,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,269 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 8 treesize of output 1 [2023-11-28 23:58:54,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:58:54,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:58:54,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 23:58:54,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:58:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 23:58:55,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:58:55,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912864443] [2023-11-28 23:58:55,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912864443] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:58:55,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:58:55,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2023-11-28 23:58:55,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93462441] [2023-11-28 23:58:55,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:58:55,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 23:58:55,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:58:55,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 23:58:55,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-11-28 23:58:57,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2023-11-28 23:58:57,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 360 flow. Second operand has 14 states, 14 states have (on average 35.42857142857143) internal successors, (496), 14 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:58:57,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:58:57,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2023-11-28 23:58:57,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:59:00,014 INFO L124 PetriNetUnfolderBase]: 2356/3672 cut-off events. [2023-11-28 23:59:00,014 INFO L125 PetriNetUnfolderBase]: For 8108/8487 co-relation queries the response was YES. [2023-11-28 23:59:00,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12612 conditions, 3672 events. 2356/3672 cut-off events. For 8108/8487 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 18573 event pairs, 413 based on Foata normal form. 377/3972 useless extension candidates. Maximal degree in co-relation 12588. Up to 1184 conditions per place. [2023-11-28 23:59:00,044 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 171 selfloop transitions, 29 changer transitions 0/215 dead transitions. [2023-11-28 23:59:00,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 215 transitions, 1506 flow [2023-11-28 23:59:00,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-28 23:59:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-28 23:59:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 586 transitions. [2023-11-28 23:59:00,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7389659520807061 [2023-11-28 23:59:00,047 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 586 transitions. [2023-11-28 23:59:00,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 586 transitions. [2023-11-28 23:59:00,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:59:00,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 586 transitions. [2023-11-28 23:59:00,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 45.07692307692308) internal successors, (586), 13 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:00,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 61.0) internal successors, (854), 14 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:00,051 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 61.0) internal successors, (854), 14 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:00,051 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 360 flow. Second operand 13 states and 586 transitions. [2023-11-28 23:59:00,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 215 transitions, 1506 flow [2023-11-28 23:59:00,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 215 transitions, 1499 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:59:00,059 INFO L231 Difference]: Finished difference. Result has 87 places, 80 transitions, 512 flow [2023-11-28 23:59:00,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=512, PETRI_PLACES=87, PETRI_TRANSITIONS=80} [2023-11-28 23:59:00,059 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 24 predicate places. [2023-11-28 23:59:00,059 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 80 transitions, 512 flow [2023-11-28 23:59:00,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 35.42857142857143) internal successors, (496), 14 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:00,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:59:00,060 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2023-11-28 23:59:00,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-28 23:59:00,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:59:00,260 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:59:00,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:00,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1033594139, now seen corresponding path program 2 times [2023-11-28 23:59:00,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:59:00,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143440454] [2023-11-28 23:59:00,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:59:00,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:59:00,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:59:00,262 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:59:00,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-28 23:59:00,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 23:59:00,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:59:00,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-28 23:59:00,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:59:00,368 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 13 treesize of output 7 [2023-11-28 23:59:00,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:00,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:00,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:00,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-28 23:59:00,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:00,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:00,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,458 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 8 treesize of output 1 [2023-11-28 23:59:00,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,465 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 8 treesize of output 1 [2023-11-28 23:59:00,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:00,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:00,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:00,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:00,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:00,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,530 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 8 treesize of output 1 [2023-11-28 23:59:00,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:00,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:00,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,547 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 8 treesize of output 1 [2023-11-28 23:59:00,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:00,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,559 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 8 treesize of output 1 [2023-11-28 23:59:00,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:00,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,570 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 8 treesize of output 1 [2023-11-28 23:59:00,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:00,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:00,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:59:00,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:59:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:59:01,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:59:01,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143440454] [2023-11-28 23:59:01,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143440454] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:59:01,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:59:01,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2023-11-28 23:59:01,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163196903] [2023-11-28 23:59:01,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:59:01,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 23:59:01,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:59:01,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 23:59:01,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-28 23:59:04,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-28 23:59:04,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 80 transitions, 512 flow. Second operand has 14 states, 14 states have (on average 36.57142857142857) internal successors, (512), 14 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:04,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:59:04,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-28 23:59:04,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:59:07,729 INFO L124 PetriNetUnfolderBase]: 2051/3321 cut-off events. [2023-11-28 23:59:07,729 INFO L125 PetriNetUnfolderBase]: For 13048/13642 co-relation queries the response was YES. [2023-11-28 23:59:07,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13109 conditions, 3321 events. 2051/3321 cut-off events. For 13048/13642 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18065 event pairs, 1008 based on Foata normal form. 130/3154 useless extension candidates. Maximal degree in co-relation 13082. Up to 2690 conditions per place. [2023-11-28 23:59:07,752 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 46 selfloop transitions, 31 changer transitions 0/98 dead transitions. [2023-11-28 23:59:07,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 98 transitions, 774 flow [2023-11-28 23:59:07,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-28 23:59:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-28 23:59:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 830 transitions. [2023-11-28 23:59:07,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6184798807749627 [2023-11-28 23:59:07,756 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 830 transitions. [2023-11-28 23:59:07,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 830 transitions. [2023-11-28 23:59:07,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:59:07,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 830 transitions. [2023-11-28 23:59:07,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 37.72727272727273) internal successors, (830), 22 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:07,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 61.0) internal successors, (1403), 23 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:07,762 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 61.0) internal successors, (1403), 23 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:07,762 INFO L175 Difference]: Start difference. First operand has 87 places, 80 transitions, 512 flow. Second operand 22 states and 830 transitions. [2023-11-28 23:59:07,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 98 transitions, 774 flow [2023-11-28 23:59:07,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 98 transitions, 727 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-11-28 23:59:07,774 INFO L231 Difference]: Finished difference. Result has 110 places, 98 transitions, 665 flow [2023-11-28 23:59:07,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=665, PETRI_PLACES=110, PETRI_TRANSITIONS=98} [2023-11-28 23:59:07,774 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 47 predicate places. [2023-11-28 23:59:07,774 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 98 transitions, 665 flow [2023-11-28 23:59:07,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 36.57142857142857) internal successors, (512), 14 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:07,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:59:07,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:59:07,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-28 23:59:07,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:59:07,976 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:59:07,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash -415757582, now seen corresponding path program 1 times [2023-11-28 23:59:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:59:07,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091594968] [2023-11-28 23:59:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:59:07,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:59:07,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:59:07,977 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:59:07,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-28 23:59:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:59:08,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 23:59:08,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:59:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:59:08,183 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:59:08,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:59:08,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091594968] [2023-11-28 23:59:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091594968] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:59:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:59:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:59:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194241149] [2023-11-28 23:59:08,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:59:08,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:59:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:59:08,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:59:08,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:59:08,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-28 23:59:08,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 98 transitions, 665 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:08,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:59:08,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-28 23:59:08,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:59:08,950 INFO L124 PetriNetUnfolderBase]: 2635/4145 cut-off events. [2023-11-28 23:59:08,950 INFO L125 PetriNetUnfolderBase]: For 13169/13884 co-relation queries the response was YES. [2023-11-28 23:59:08,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15657 conditions, 4145 events. 2635/4145 cut-off events. For 13169/13884 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 22527 event pairs, 1286 based on Foata normal form. 162/3843 useless extension candidates. Maximal degree in co-relation 15624. Up to 3262 conditions per place. [2023-11-28 23:59:08,974 INFO L140 encePairwiseOnDemand]: 55/61 looper letters, 93 selfloop transitions, 5 changer transitions 0/119 dead transitions. [2023-11-28 23:59:08,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 119 transitions, 937 flow [2023-11-28 23:59:08,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:59:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:59:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2023-11-28 23:59:08,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.740983606557377 [2023-11-28 23:59:08,976 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 226 transitions. [2023-11-28 23:59:08,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 226 transitions. [2023-11-28 23:59:08,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:59:08,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 226 transitions. [2023-11-28 23:59:08,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:08,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:08,978 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 61.0) internal successors, (366), 6 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:08,979 INFO L175 Difference]: Start difference. First operand has 110 places, 98 transitions, 665 flow. Second operand 5 states and 226 transitions. [2023-11-28 23:59:08,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 119 transitions, 937 flow [2023-11-28 23:59:08,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 119 transitions, 857 flow, removed 27 selfloop flow, removed 9 redundant places. [2023-11-28 23:59:08,988 INFO L231 Difference]: Finished difference. Result has 107 places, 100 transitions, 610 flow [2023-11-28 23:59:08,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=610, PETRI_PLACES=107, PETRI_TRANSITIONS=100} [2023-11-28 23:59:08,989 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 44 predicate places. [2023-11-28 23:59:08,989 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 100 transitions, 610 flow [2023-11-28 23:59:08,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:08,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:59:08,989 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:59:08,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-28 23:59:09,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:59:09,190 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:59:09,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash 587082648, now seen corresponding path program 1 times [2023-11-28 23:59:09,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:59:09,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785932862] [2023-11-28 23:59:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:59:09,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:59:09,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:59:09,192 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:59:09,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-28 23:59:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:59:09,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-28 23:59:09,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:59:09,282 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 8 treesize of output 7 [2023-11-28 23:59:09,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:09,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:09,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:09,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:09,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,340 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 8 treesize of output 1 [2023-11-28 23:59:09,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:09,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,356 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 8 treesize of output 1 [2023-11-28 23:59:09,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:09,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,370 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 8 treesize of output 1 [2023-11-28 23:59:09,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:09,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:09,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:09,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-28 23:59:09,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:09,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:09,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:09,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:09,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,501 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 8 treesize of output 1 [2023-11-28 23:59:09,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:09,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:09,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,523 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 8 treesize of output 1 [2023-11-28 23:59:09,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:09,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:09,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 23:59:09,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:59:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 23:59:10,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:59:10,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785932862] [2023-11-28 23:59:10,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785932862] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:59:10,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:59:10,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2023-11-28 23:59:10,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022915746] [2023-11-28 23:59:10,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:59:10,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 23:59:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:59:10,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 23:59:10,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-11-28 23:59:13,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2023-11-28 23:59:13,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 100 transitions, 610 flow. Second operand has 14 states, 14 states have (on average 35.714285714285715) internal successors, (500), 14 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:13,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:59:13,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2023-11-28 23:59:13,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:59:15,536 INFO L124 PetriNetUnfolderBase]: 4313/6357 cut-off events. [2023-11-28 23:59:15,536 INFO L125 PetriNetUnfolderBase]: For 14766/15693 co-relation queries the response was YES. [2023-11-28 23:59:15,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24762 conditions, 6357 events. 4313/6357 cut-off events. For 14766/15693 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 32529 event pairs, 1033 based on Foata normal form. 401/6532 useless extension candidates. Maximal degree in co-relation 24727. Up to 2547 conditions per place. [2023-11-28 23:59:15,599 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 224 selfloop transitions, 38 changer transitions 4/285 dead transitions. [2023-11-28 23:59:15,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 285 transitions, 2276 flow [2023-11-28 23:59:15,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-28 23:59:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-28 23:59:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 574 transitions. [2023-11-28 23:59:15,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7238335435056746 [2023-11-28 23:59:15,602 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 574 transitions. [2023-11-28 23:59:15,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 574 transitions. [2023-11-28 23:59:15,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:59:15,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 574 transitions. [2023-11-28 23:59:15,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 44.15384615384615) internal successors, (574), 13 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:15,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 61.0) internal successors, (854), 14 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:15,605 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 61.0) internal successors, (854), 14 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:15,605 INFO L175 Difference]: Start difference. First operand has 107 places, 100 transitions, 610 flow. Second operand 13 states and 574 transitions. [2023-11-28 23:59:15,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 285 transitions, 2276 flow [2023-11-28 23:59:15,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 285 transitions, 2271 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:59:15,625 INFO L231 Difference]: Finished difference. Result has 120 places, 113 transitions, 792 flow [2023-11-28 23:59:15,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=792, PETRI_PLACES=120, PETRI_TRANSITIONS=113} [2023-11-28 23:59:15,626 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 57 predicate places. [2023-11-28 23:59:15,626 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 113 transitions, 792 flow [2023-11-28 23:59:15,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 35.714285714285715) internal successors, (500), 14 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:15,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:59:15,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:59:15,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-28 23:59:15,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:59:15,827 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:59:15,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:15,827 INFO L85 PathProgramCache]: Analyzing trace with hash 746633942, now seen corresponding path program 1 times [2023-11-28 23:59:15,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:59:15,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334142259] [2023-11-28 23:59:15,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:59:15,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:59:15,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:59:15,829 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:59:15,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-28 23:59:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:59:15,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-28 23:59:15,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:59:15,932 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 13 treesize of output 7 [2023-11-28 23:59:15,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:15,939 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 8 treesize of output 1 [2023-11-28 23:59:15,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:15,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:15,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:15,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:15,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:15,971 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 8 treesize of output 1 [2023-11-28 23:59:15,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:15,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:15,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:15,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:16,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:16,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:16,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,021 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 8 treesize of output 1 [2023-11-28 23:59:16,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:16,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,036 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 8 treesize of output 1 [2023-11-28 23:59:16,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,044 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 8 treesize of output 1 [2023-11-28 23:59:16,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:16,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:16,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,067 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 8 treesize of output 1 [2023-11-28 23:59:16,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:16,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:16,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:16,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:16,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:16,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-28 23:59:16,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:16,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:16,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:59:16,618 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:59:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:59:17,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:59:17,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334142259] [2023-11-28 23:59:17,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334142259] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:59:17,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:59:17,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2023-11-28 23:59:17,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050945963] [2023-11-28 23:59:17,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:59:17,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 23:59:17,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:59:17,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 23:59:17,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-11-28 23:59:24,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 61 [2023-11-28 23:59:24,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 113 transitions, 792 flow. Second operand has 14 states, 14 states have (on average 34.714285714285715) internal successors, (486), 14 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:24,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:59:24,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 61 [2023-11-28 23:59:24,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:59:31,008 INFO L124 PetriNetUnfolderBase]: 19207/27200 cut-off events. [2023-11-28 23:59:31,008 INFO L125 PetriNetUnfolderBase]: For 122569/126306 co-relation queries the response was YES. [2023-11-28 23:59:31,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123902 conditions, 27200 events. 19207/27200 cut-off events. For 122569/126306 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 164962 event pairs, 7889 based on Foata normal form. 710/24211 useless extension candidates. Maximal degree in co-relation 123864. Up to 10004 conditions per place. [2023-11-28 23:59:31,245 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 320 selfloop transitions, 40 changer transitions 0/383 dead transitions. [2023-11-28 23:59:31,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 383 transitions, 3708 flow [2023-11-28 23:59:31,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-28 23:59:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-28 23:59:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 637 transitions. [2023-11-28 23:59:31,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6961748633879782 [2023-11-28 23:59:31,248 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 637 transitions. [2023-11-28 23:59:31,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 637 transitions. [2023-11-28 23:59:31,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:59:31,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 637 transitions. [2023-11-28 23:59:31,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 42.46666666666667) internal successors, (637), 15 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:31,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 61.0) internal successors, (976), 16 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:31,252 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 61.0) internal successors, (976), 16 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:31,252 INFO L175 Difference]: Start difference. First operand has 120 places, 113 transitions, 792 flow. Second operand 15 states and 637 transitions. [2023-11-28 23:59:31,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 383 transitions, 3708 flow [2023-11-28 23:59:31,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 383 transitions, 3378 flow, removed 70 selfloop flow, removed 5 redundant places. [2023-11-28 23:59:31,382 INFO L231 Difference]: Finished difference. Result has 133 places, 127 transitions, 964 flow [2023-11-28 23:59:31,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=964, PETRI_PLACES=133, PETRI_TRANSITIONS=127} [2023-11-28 23:59:31,382 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 70 predicate places. [2023-11-28 23:59:31,382 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 127 transitions, 964 flow [2023-11-28 23:59:31,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 34.714285714285715) internal successors, (486), 14 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:31,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:59:31,383 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:59:31,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 23:59:31,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:59:31,583 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:59:31,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:31,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2120736143, now seen corresponding path program 2 times [2023-11-28 23:59:31,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:59:31,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576262249] [2023-11-28 23:59:31,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:59:31,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:59:31,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:59:31,585 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:59:31,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-28 23:59:31,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 23:59:31,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:59:31,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-28 23:59:31,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:59:31,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-28 23:59:31,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-28 23:59:31,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:31,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:31,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:31,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:31,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:31,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:31,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:31,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,872 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 8 treesize of output 1 [2023-11-28 23:59:31,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:31,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,901 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 8 treesize of output 1 [2023-11-28 23:59:31,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:31,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,921 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 8 treesize of output 1 [2023-11-28 23:59:31,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,930 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 8 treesize of output 1 [2023-11-28 23:59:31,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:31,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:31,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:31,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,984 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 8 treesize of output 1 [2023-11-28 23:59:31,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:31,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:32,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:32,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:32,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:32,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:32,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:32,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:32,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:32,045 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 8 treesize of output 1 [2023-11-28 23:59:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:59:32,497 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:59:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:59:33,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:59:33,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576262249] [2023-11-28 23:59:33,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576262249] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:59:33,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:59:33,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-11-28 23:59:33,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378231067] [2023-11-28 23:59:33,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:59:33,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-28 23:59:33,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:59:33,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-28 23:59:33,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-11-28 23:59:40,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-28 23:59:40,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 127 transitions, 964 flow. Second operand has 17 states, 17 states have (on average 36.294117647058826) internal successors, (617), 17 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:40,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:59:40,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-28 23:59:40,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:59:47,149 INFO L124 PetriNetUnfolderBase]: 10893/16594 cut-off events. [2023-11-28 23:59:47,149 INFO L125 PetriNetUnfolderBase]: For 88955/94315 co-relation queries the response was YES. [2023-11-28 23:59:47,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78513 conditions, 16594 events. 10893/16594 cut-off events. For 88955/94315 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 105329 event pairs, 3735 based on Foata normal form. 1153/16560 useless extension candidates. Maximal degree in co-relation 78471. Up to 6580 conditions per place. [2023-11-28 23:59:47,309 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 307 selfloop transitions, 62 changer transitions 0/396 dead transitions. [2023-11-28 23:59:47,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 396 transitions, 3665 flow [2023-11-28 23:59:47,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-28 23:59:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-28 23:59:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 734 transitions. [2023-11-28 23:59:47,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7520491803278688 [2023-11-28 23:59:47,312 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 734 transitions. [2023-11-28 23:59:47,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 734 transitions. [2023-11-28 23:59:47,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:59:47,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 734 transitions. [2023-11-28 23:59:47,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 45.875) internal successors, (734), 16 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:47,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 61.0) internal successors, (1037), 17 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:47,316 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 61.0) internal successors, (1037), 17 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:47,316 INFO L175 Difference]: Start difference. First operand has 133 places, 127 transitions, 964 flow. Second operand 16 states and 734 transitions. [2023-11-28 23:59:47,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 396 transitions, 3665 flow [2023-11-28 23:59:47,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 396 transitions, 3594 flow, removed 23 selfloop flow, removed 7 redundant places. [2023-11-28 23:59:47,472 INFO L231 Difference]: Finished difference. Result has 147 places, 162 transitions, 1490 flow [2023-11-28 23:59:47,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1490, PETRI_PLACES=147, PETRI_TRANSITIONS=162} [2023-11-28 23:59:47,473 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 84 predicate places. [2023-11-28 23:59:47,473 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 162 transitions, 1490 flow [2023-11-28 23:59:47,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 36.294117647058826) internal successors, (617), 17 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:59:47,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:59:47,474 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:59:47,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-28 23:59:47,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:59:47,675 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-28 23:59:47,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:59:47,677 INFO L85 PathProgramCache]: Analyzing trace with hash 522434142, now seen corresponding path program 1 times [2023-11-28 23:59:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:59:47,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400475677] [2023-11-28 23:59:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:59:47,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:59:47,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:59:47,682 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 23:59:47,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-28 23:59:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:59:47,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-28 23:59:47,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:59:47,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-28 23:59:47,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:47,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:47,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:47,960 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 8 treesize of output 1 [2023-11-28 23:59:47,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:47,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:47,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:47,976 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 8 treesize of output 1 [2023-11-28 23:59:47,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:47,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:47,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:47,994 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 8 treesize of output 1 [2023-11-28 23:59:48,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:48,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,011 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 8 treesize of output 1 [2023-11-28 23:59:48,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:48,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:48,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:48,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,055 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 8 treesize of output 1 [2023-11-28 23:59:48,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:48,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,072 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 8 treesize of output 1 [2023-11-28 23:59:48,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:48,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:48,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:48,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:48,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-28 23:59:48,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:48,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:48,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-28 23:59:48,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 23:59:48,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-28 23:59:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:59:48,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 23:59:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:59:51,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:59:51,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400475677] [2023-11-28 23:59:51,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400475677] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 23:59:51,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 23:59:51,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-11-28 23:59:51,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409463145] [2023-11-28 23:59:51,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 23:59:51,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-28 23:59:51,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:59:51,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-28 23:59:51,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:00:01,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2023-11-29 00:00:01,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 162 transitions, 1490 flow. Second operand has 18 states, 18 states have (on average 35.77777777777778) internal successors, (644), 18 states have internal predecessors, (644), 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 00:00:01,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:00:01,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2023-11-29 00:00:01,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:00:24,090 INFO L124 PetriNetUnfolderBase]: 40370/55914 cut-off events. [2023-11-29 00:00:24,091 INFO L125 PetriNetUnfolderBase]: For 359343/368223 co-relation queries the response was YES. [2023-11-29 00:00:24,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295652 conditions, 55914 events. 40370/55914 cut-off events. For 359343/368223 co-relation queries the response was YES. Maximal size of possible extension queue 1614. Compared 351913 event pairs, 13569 based on Foata normal form. 1461/50139 useless extension candidates. Maximal degree in co-relation 295604. Up to 21716 conditions per place. [2023-11-29 00:00:24,781 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 716 selfloop transitions, 75 changer transitions 0/815 dead transitions. [2023-11-29 00:00:24,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 815 transitions, 9455 flow [2023-11-29 00:00:24,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 00:00:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-29 00:00:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1011 transitions. [2023-11-29 00:00:24,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7205987170349252 [2023-11-29 00:00:24,784 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1011 transitions. [2023-11-29 00:00:24,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1011 transitions. [2023-11-29 00:00:24,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:24,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1011 transitions. [2023-11-29 00:00:24,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 43.95652173913044) internal successors, (1011), 23 states have internal predecessors, (1011), 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 00:00:24,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 61.0) internal successors, (1464), 24 states have internal predecessors, (1464), 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 00:00:24,789 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 61.0) internal successors, (1464), 24 states have internal predecessors, (1464), 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 00:00:24,789 INFO L175 Difference]: Start difference. First operand has 147 places, 162 transitions, 1490 flow. Second operand 23 states and 1011 transitions. [2023-11-29 00:00:24,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 815 transitions, 9455 flow [2023-11-29 00:00:25,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 815 transitions, 9307 flow, removed 61 selfloop flow, removed 4 redundant places. [2023-11-29 00:00:25,811 INFO L231 Difference]: Finished difference. Result has 168 places, 210 transitions, 2268 flow [2023-11-29 00:00:25,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2268, PETRI_PLACES=168, PETRI_TRANSITIONS=210} [2023-11-29 00:00:25,812 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 105 predicate places. [2023-11-29 00:00:25,812 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 210 transitions, 2268 flow [2023-11-29 00:00:25,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 35.77777777777778) internal successors, (644), 18 states have internal predecessors, (644), 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 00:00:25,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:00:25,813 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:25,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 00:00:26,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:00:26,014 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 00:00:26,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:26,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1194005052, now seen corresponding path program 2 times [2023-11-29 00:00:26,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:00:26,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601208038] [2023-11-29 00:00:26,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:00:26,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:00:26,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:00:26,016 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:00:26,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:00:26,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:00:26,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:00:26,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 00:00:26,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:00:26,163 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 13 treesize of output 7 [2023-11-29 00:00:26,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:00:26,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,194 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 8 treesize of output 1 [2023-11-29 00:00:26,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:26,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,212 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 8 treesize of output 1 [2023-11-29 00:00:26,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:26,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,231 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 8 treesize of output 1 [2023-11-29 00:00:26,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:26,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:00:26,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:26,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:26,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,291 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 8 treesize of output 1 [2023-11-29 00:00:26,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:00:26,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:26,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,325 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 8 treesize of output 1 [2023-11-29 00:00:26,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:26,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:26,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,348 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 8 treesize of output 1 [2023-11-29 00:00:26,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:26,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:00:26,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-29 00:00:26,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:00:26,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:26,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:26,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:00:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:26,985 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:00:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:00:28,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:00:28,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601208038] [2023-11-29 00:00:28,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601208038] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:00:28,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:00:28,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-11-29 00:00:28,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844213941] [2023-11-29 00:00:28,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:00:28,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 00:00:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:00:28,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 00:00:28,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-11-29 00:00:37,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-29 00:00:37,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 210 transitions, 2268 flow. Second operand has 17 states, 17 states have (on average 36.529411764705884) internal successors, (621), 17 states have internal predecessors, (621), 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 00:00:37,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:00:37,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-29 00:00:37,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:00:47,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([441] L57-->L56-6: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_9))) (let ((.cse0 (bvadd v_~A~0.offset_27 .cse3)) (.cse1 (bvadd v_~A~0.offset_27 (_ bv4 32) .cse3))) (and (bvule .cse0 .cse1) (= (bvadd (_ bv1 1) (select |v_#valid_60| v_~A~0.base_30)) (_ bv0 1)) (bvule (_ bv0 32) .cse0) (= v_thread2Thread1of1ForFork2_~i~1_10 (bvadd v_thread2Thread1of1ForFork2_~i~1_9 (_ bv1 32))) (= v_~sum2~0_21 (bvadd v_~sum2~0_22 (let ((.cse2 (select |v_#memory_int#3_24| v_~A~0.base_30))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_27 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_27 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_27 (_ bv1 32) .cse3))) (select .cse2 .cse0))))) (bvule .cse1 (select |v_#length_49| v_~A~0.base_30))))) InVars {~A~0.base=v_~A~0.base_30, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_9, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_60|, ~sum2~0=v_~sum2~0_22, #length=|v_#length_49|, #memory_int#3=|v_#memory_int#3_24|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, ~A~0.base=v_~A~0.base_30, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_10, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_1|, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_60|, ~sum2~0=v_~sum2~0_21, #length=|v_#length_49|, #memory_int#3=|v_#memory_int#3_24|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][265], [715#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (or (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (not (bvslt thread2Thread1of1ForFork2_~i~1 ~M~0))) (bvsge ~M~0 (_ bv0 32)) (or (and (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt (bvadd thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) ~M~0)))), 32#L56-6true, 164#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 136#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 154#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 150#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_2 (_ BitVec 32))) (and (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)) (bvslt (_ bv1 32) v_subst_2))) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 1137#true, 100#(or (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))))), 726#true, Black: 560#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 556#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 282#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), Black: 506#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 552#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 548#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_5 (_ BitVec 32))) (and (bvslt (_ bv4 32) v_subst_5) (bvule v_subst_5 (_ bv1073741823 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_5)))) (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 206#(= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)), Black: 564#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 843#true, Black: 837#(and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))), Black: 835#(and (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))) (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))) (not (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0)))), Black: 831#(and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0) (= ~A~0.offset (_ bv0 32)) (bvsle thread3Thread1of1ForFork1_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0)) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork1_~i~2 (_ bv0 32))), 50#L49true, Black: 833#(and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (exists ((v_subst_10 (_ BitVec 32))) (and (bvslt thread3Thread1of1ForFork1_~i~2 v_subst_10) (not (bvslt (_ bv1 32) v_subst_10)))) (bvslt (_ bv0 32) ~N~0) (= ~A~0.offset (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork1_~i~2 (_ bv0 32))), Black: 869#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ BitVec 32))) (and (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 961#(and (or (and (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 967#(and (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 876#(and (= thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ BitVec 32))) (and (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), Black: 452#(and (= thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (exists ((v_subst_4 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) v_subst_4) (select |#length| ~A~0.base)) (bvslt (_ bv1 32) v_subst_4) (bvule v_subst_4 (_ bv1073741823 32))))), Black: 965#(and (or (not (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32))) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 324#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 969#(and (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)))) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 456#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 314#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), 183#(or (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))), Black: 721#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))), Black: 717#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt (bvadd thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) ~M~0)))), Black: 713#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) (bvslt (_ bv0 32) ~M~0) (exists ((~N~0 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), Black: 91#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_1 (_ BitVec 32))) (and (bvslt (_ bv0 32) v_subst_1) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule v_subst_1 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 1060#(or (not (bvslt (bvadd ~M~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))), 37#L85true, 110#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 29#thread3EXITtrue, Black: 614#(and (bvsle ~M~0 ~N~0) (bvsle thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork1_~i~2 (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), 465#true, 254#(or (and (exists ((|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1)))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1)))) (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1)))))), Black: 1132#(and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd ~M~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))), Black: 1126#(and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~A~0.offset (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork1_~i~2 (_ bv0 32)) (exists ((v_subst_21 (_ BitVec 32))) (and (bvslt thread3Thread1of1ForFork1_~i~2 v_subst_21) (not (bvslt (_ bv2 32) v_subst_21)))) (bvsge (bvadd thread3Thread1of1ForFork1_~i~2 (_ bv4294967295 32)) (_ bv0 32))), 460#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 365#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 371#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (exists ((~N~0 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 245#(and (exists ((v_subst_3 (_ BitVec 32))) (and (bvule v_subst_3 (_ bv1073741823 32)) (bvslt (_ bv0 32) v_subst_3) (= (bvmul (_ bv4 32) v_subst_3) (select |#length| ~A~0.base)))) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 239#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)))]) [2023-11-29 00:00:47,822 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 00:00:47,822 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 00:00:47,822 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 00:00:47,822 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 00:00:47,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L49-->L48-6: Formula: (let ((.cse2 (bvmul (_ bv4 32) v_thread1Thread1of1ForFork0_~i~0_9))) (let ((.cse0 (bvadd v_~A~0.offset_17 (_ bv4 32) .cse2)) (.cse3 (bvadd v_~A~0.offset_17 .cse2))) (and (bvule .cse0 (select |v_#length_39| v_~A~0.base_20)) (= (bvadd (let ((.cse1 (select |v_#memory_int#3_14| v_~A~0.base_20))) (concat (concat (concat (select .cse1 (bvadd v_~A~0.offset_17 (_ bv3 32) .cse2)) (select .cse1 (bvadd v_~A~0.offset_17 (_ bv2 32) .cse2))) (select .cse1 (bvadd v_~A~0.offset_17 .cse2 (_ bv1 32)))) (select .cse1 .cse3))) v_~sum1~0_22) v_~sum1~0_21) (bvule .cse3 .cse0) (= (_ bv0 1) (bvadd (select |v_#valid_50| v_~A~0.base_20) (_ bv1 1))) (= (bvadd (_ bv1 32) v_thread1Thread1of1ForFork0_~i~0_9) v_thread1Thread1of1ForFork0_~i~0_10) (bvule (_ bv0 32) .cse3)))) InVars {~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_17, ~sum1~0=v_~sum1~0_22, #valid=|v_#valid_50|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9, #length=|v_#length_39|, #memory_int#3=|v_#memory_int#3_14|} OutVars{~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_1|, ~A~0.offset=v_~A~0.offset_17, ~sum1~0=v_~sum1~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, #valid=|v_#valid_50|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_10, #length=|v_#length_39|, #memory_int#3=|v_#memory_int#3_14|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, ~sum1~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0][305], [164#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 136#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 154#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 150#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_2 (_ BitVec 32))) (and (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)) (bvslt (_ bv1 32) v_subst_2))) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 1137#true, 100#(or (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))))), 726#true, Black: 560#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 556#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 282#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), Black: 506#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 552#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 548#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_5 (_ BitVec 32))) (and (bvslt (_ bv4 32) v_subst_5) (bvule v_subst_5 (_ bv1073741823 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_5)))) (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 206#(= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)), Black: 564#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 713#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) (bvslt (_ bv0 32) ~M~0) (exists ((~N~0 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), 843#true, Black: 837#(and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))), Black: 835#(and (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))) (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))) (not (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0)))), Black: 831#(and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0) (= ~A~0.offset (_ bv0 32)) (bvsle thread3Thread1of1ForFork1_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0)) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork1_~i~2 (_ bv0 32))), Black: 833#(and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (exists ((v_subst_10 (_ BitVec 32))) (and (bvslt thread3Thread1of1ForFork1_~i~2 v_subst_10) (not (bvslt (_ bv1 32) v_subst_10)))) (bvslt (_ bv0 32) ~N~0) (= ~A~0.offset (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork1_~i~2 (_ bv0 32))), Black: 869#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ BitVec 32))) (and (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 961#(and (or (and (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 967#(and (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 876#(and (= thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ BitVec 32))) (and (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), Black: 460#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 452#(and (= thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (exists ((v_subst_4 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) v_subst_4) (select |#length| ~A~0.base)) (bvslt (_ bv1 32) v_subst_4) (bvule v_subst_4 (_ bv1073741823 32))))), Black: 965#(and (or (not (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32))) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 324#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 969#(and (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)))) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 456#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 314#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), 183#(or (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))), Black: 721#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))), Black: 717#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt (bvadd thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) ~M~0)))), Black: 91#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_1 (_ BitVec 32))) (and (bvslt (_ bv0 32) v_subst_1) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule v_subst_1 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 1060#(or (not (bvslt (bvadd ~M~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))), 37#L85true, 110#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 29#thread3EXITtrue, Black: 614#(and (bvsle ~M~0 ~N~0) (bvsle thread3Thread1of1ForFork1_~i~2 ~N~0) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork1_~i~2 (_ bv0 32)) (not (bvslt (_ bv0 32) ~N~0))), 465#true, 254#(or (and (exists ((|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1)))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1)))) (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1)))))), Black: 1132#(and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd ~M~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))), Black: 1126#(and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0) (= ~A~0.offset (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsge ~M~0 (_ bv0 32)) (bvsge thread3Thread1of1ForFork1_~i~2 (_ bv0 32)) (exists ((v_subst_21 (_ BitVec 32))) (and (bvslt thread3Thread1of1ForFork1_~i~2 v_subst_21) (not (bvslt (_ bv2 32) v_subst_21)))) (bvsge (bvadd thread3Thread1of1ForFork1_~i~2 (_ bv4294967295 32)) (_ bv0 32))), 38#L57true, 390#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32))), Black: 365#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 371#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (exists ((~N~0 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 245#(and (exists ((v_subst_3 (_ BitVec 32))) (and (bvule v_subst_3 (_ bv1073741823 32)) (bvslt (_ bv0 32) v_subst_3) (= (bvmul (_ bv4 32) v_subst_3) (select |#length| ~A~0.base)))) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 35#L48-6true, Black: 239#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)))]) [2023-11-29 00:00:47,825 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 00:00:47,825 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 00:00:47,825 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 00:00:47,825 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 00:00:49,431 INFO L124 PetriNetUnfolderBase]: 26327/39329 cut-off events. [2023-11-29 00:00:49,431 INFO L125 PetriNetUnfolderBase]: For 327655/341311 co-relation queries the response was YES. [2023-11-29 00:00:49,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220019 conditions, 39329 events. 26327/39329 cut-off events. For 327655/341311 co-relation queries the response was YES. Maximal size of possible extension queue 1232. Compared 273509 event pairs, 9202 based on Foata normal form. 1876/37695 useless extension candidates. Maximal degree in co-relation 219967. Up to 15262 conditions per place. [2023-11-29 00:00:50,047 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 396 selfloop transitions, 72 changer transitions 0/502 dead transitions. [2023-11-29 00:00:50,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 502 transitions, 6192 flow [2023-11-29 00:00:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 00:00:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-29 00:00:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 729 transitions. [2023-11-29 00:00:50,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7469262295081968 [2023-11-29 00:00:50,050 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 729 transitions. [2023-11-29 00:00:50,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 729 transitions. [2023-11-29 00:00:50,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:00:50,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 729 transitions. [2023-11-29 00:00:50,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 45.5625) internal successors, (729), 16 states have internal predecessors, (729), 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 00:00:50,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 61.0) internal successors, (1037), 17 states have internal predecessors, (1037), 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 00:00:50,055 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 61.0) internal successors, (1037), 17 states have internal predecessors, (1037), 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 00:00:50,055 INFO L175 Difference]: Start difference. First operand has 168 places, 210 transitions, 2268 flow. Second operand 16 states and 729 transitions. [2023-11-29 00:00:50,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 502 transitions, 6192 flow [2023-11-29 00:00:51,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 502 transitions, 5809 flow, removed 151 selfloop flow, removed 7 redundant places. [2023-11-29 00:00:51,551 INFO L231 Difference]: Finished difference. Result has 183 places, 238 transitions, 2691 flow [2023-11-29 00:00:51,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2691, PETRI_PLACES=183, PETRI_TRANSITIONS=238} [2023-11-29 00:00:51,551 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 120 predicate places. [2023-11-29 00:00:51,552 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 238 transitions, 2691 flow [2023-11-29 00:00:51,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 36.529411764705884) internal successors, (621), 17 states have internal predecessors, (621), 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 00:00:51,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:00:51,552 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:00:51,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:00:51,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:00:51,753 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 00:00:51,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:00:51,754 INFO L85 PathProgramCache]: Analyzing trace with hash 18437250, now seen corresponding path program 2 times [2023-11-29 00:00:51,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:00:51,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373326786] [2023-11-29 00:00:51,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:00:51,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:00:51,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:00:51,756 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:00:51,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Waiting until timeout for monitored process [2023-11-29 00:00:51,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 00:00:51,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:00:51,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:00:51,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:00:51,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-29 00:00:51,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:51,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:51,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:51,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:51,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:51,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:00:51,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:51,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-29 00:00:51,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:51,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:00:51,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:51,982 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 8 treesize of output 1 [2023-11-29 00:00:51,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:51,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:52,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:52,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:00:52,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,028 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 8 treesize of output 1 [2023-11-29 00:00:52,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:52,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,044 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 8 treesize of output 1 [2023-11-29 00:00:52,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:52,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,059 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 8 treesize of output 1 [2023-11-29 00:00:52,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:52,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:00:52,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:52,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:52,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:00:52,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,134 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 8 treesize of output 1 [2023-11-29 00:00:52,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:52,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,151 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 8 treesize of output 1 [2023-11-29 00:00:52,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:00:52,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:00:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:00:52,540 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:00:52,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:00:52,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373326786] [2023-11-29 00:00:52,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373326786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:00:52,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:00:52,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:00:52,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54450935] [2023-11-29 00:00:52,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:00:52,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:00:52,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:00:52,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:00:52,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:00:53,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2023-11-29 00:00:53,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 238 transitions, 2691 flow. Second operand has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 00:00:53,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:00:53,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2023-11-29 00:00:53,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:02,380 INFO L124 PetriNetUnfolderBase]: 36308/49820 cut-off events. [2023-11-29 00:01:02,381 INFO L125 PetriNetUnfolderBase]: For 385477/393301 co-relation queries the response was YES. [2023-11-29 00:01:02,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285375 conditions, 49820 events. 36308/49820 cut-off events. For 385477/393301 co-relation queries the response was YES. Maximal size of possible extension queue 1434. Compared 301216 event pairs, 6806 based on Foata normal form. 1930/46361 useless extension candidates. Maximal degree in co-relation 285317. Up to 20290 conditions per place. [2023-11-29 00:01:03,073 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 297 selfloop transitions, 94 changer transitions 0/415 dead transitions. [2023-11-29 00:01:03,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 415 transitions, 5487 flow [2023-11-29 00:01:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:01:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:01:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 247 transitions. [2023-11-29 00:01:03,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.674863387978142 [2023-11-29 00:01:03,075 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 247 transitions. [2023-11-29 00:01:03,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 247 transitions. [2023-11-29 00:01:03,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:03,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 247 transitions. [2023-11-29 00:01:03,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 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 00:01:03,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 61.0) internal successors, (427), 7 states have internal predecessors, (427), 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 00:01:03,077 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 61.0) internal successors, (427), 7 states have internal predecessors, (427), 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 00:01:03,077 INFO L175 Difference]: Start difference. First operand has 183 places, 238 transitions, 2691 flow. Second operand 6 states and 247 transitions. [2023-11-29 00:01:03,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 415 transitions, 5487 flow [2023-11-29 00:01:05,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 415 transitions, 5333 flow, removed 44 selfloop flow, removed 7 redundant places. [2023-11-29 00:01:05,480 INFO L231 Difference]: Finished difference. Result has 180 places, 237 transitions, 2747 flow [2023-11-29 00:01:05,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2559, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2747, PETRI_PLACES=180, PETRI_TRANSITIONS=237} [2023-11-29 00:01:05,481 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 117 predicate places. [2023-11-29 00:01:05,481 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 237 transitions, 2747 flow [2023-11-29 00:01:05,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 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 00:01:05,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:05,482 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 5, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:05,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 00:01:05,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:01:05,683 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 00:01:05,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:05,683 INFO L85 PathProgramCache]: Analyzing trace with hash 720353465, now seen corresponding path program 3 times [2023-11-29 00:01:05,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:01:05,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062609411] [2023-11-29 00:01:05,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:01:05,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:01:05,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:01:05,685 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:01:05,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:01:05,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 00:01:05,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:01:05,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 00:01:05,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:01:05,946 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 13 treesize of output 7 [2023-11-29 00:01:05,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:05,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:01:05,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:05,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:05,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:05,985 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 8 treesize of output 1 [2023-11-29 00:01:05,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:05,992 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 8 treesize of output 1 [2023-11-29 00:01:06,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:06,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:06,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:01:06,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:06,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,046 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 8 treesize of output 1 [2023-11-29 00:01:06,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:06,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,061 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 8 treesize of output 1 [2023-11-29 00:01:06,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:01:06,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-29 00:01:06,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:01:06,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:06,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:01:06,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:06,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:01:06,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:06,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,193 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 8 treesize of output 1 [2023-11-29 00:01:06,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:06,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:06,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:06,223 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 8 treesize of output 1 [2023-11-29 00:01:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:06,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:01:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:09,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:01:09,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062609411] [2023-11-29 00:01:09,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062609411] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:01:09,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:01:09,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2023-11-29 00:01:09,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402722282] [2023-11-29 00:01:09,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:01:09,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 00:01:09,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:01:09,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 00:01:09,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2023-11-29 00:01:22,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-29 00:01:22,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 237 transitions, 2747 flow. Second operand has 21 states, 21 states have (on average 36.333333333333336) internal successors, (763), 21 states have internal predecessors, (763), 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 00:01:22,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:22,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-29 00:01:22,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:37,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([441] L57-->L56-6: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_9))) (let ((.cse0 (bvadd v_~A~0.offset_27 .cse3)) (.cse1 (bvadd v_~A~0.offset_27 (_ bv4 32) .cse3))) (and (bvule .cse0 .cse1) (= (bvadd (_ bv1 1) (select |v_#valid_60| v_~A~0.base_30)) (_ bv0 1)) (bvule (_ bv0 32) .cse0) (= v_thread2Thread1of1ForFork2_~i~1_10 (bvadd v_thread2Thread1of1ForFork2_~i~1_9 (_ bv1 32))) (= v_~sum2~0_21 (bvadd v_~sum2~0_22 (let ((.cse2 (select |v_#memory_int#3_24| v_~A~0.base_30))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_27 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_27 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_27 (_ bv1 32) .cse3))) (select .cse2 .cse0))))) (bvule .cse1 (select |v_#length_49| v_~A~0.base_30))))) InVars {~A~0.base=v_~A~0.base_30, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_9, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_60|, ~sum2~0=v_~sum2~0_22, #length=|v_#length_49|, #memory_int#3=|v_#memory_int#3_24|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, ~A~0.base=v_~A~0.base_30, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_10, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_1|, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_60|, ~sum2~0=v_~sum2~0_21, #length=|v_#length_49|, #memory_int#3=|v_#memory_int#3_24|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][452], [Black: 1279#(and (or (not (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 1281#(and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 1271#(and (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv20 32))) (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv20 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), 715#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (or (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (not (bvslt thread2Thread1of1ForFork2_~i~1 ~M~0))) (bvsge ~M~0 (_ bv0 32)) (or (and (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt (bvadd thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) ~M~0)))), Black: 1275#(and (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)))) (or (and (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base))))), 32#L56-6true, Black: 1277#(and (or (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32))) (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), 164#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1172#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ bv1073741823 32)) (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|)))) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 1179#(and (= thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ bv1073741823 32)) (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|)))) (= ~A~0.offset (_ bv0 32))), 1361#true, Black: 136#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 154#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 150#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_2 (_ BitVec 32))) (and (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)) (bvslt (_ bv1 32) v_subst_2))) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 1137#true, 100#(or (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))))), 1323#(and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 726#true, Black: 560#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 556#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 282#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), Black: 506#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 552#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 206#(= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)), Black: 548#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_5 (_ BitVec 32))) (and (bvslt (_ bv4 32) v_subst_5) (bvule v_subst_5 (_ bv1073741823 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_5)))) (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 564#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 843#true, Black: 837#(and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))), Black: 835#(and (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))) (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))) (not (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0)))), 50#L49true, Black: 869#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ BitVec 32))) (and (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 961#(and (or (and (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 967#(and (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 876#(and (= thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ BitVec 32))) (and (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), Black: 452#(and (= thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (exists ((v_subst_4 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) v_subst_4) (select |#length| ~A~0.base)) (bvslt (_ bv1 32) v_subst_4) (bvule v_subst_4 (_ bv1073741823 32))))), Black: 324#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 965#(and (or (not (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32))) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 969#(and (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)))) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 314#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), Black: 456#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), 183#(or (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))), Black: 721#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))), Black: 717#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt (bvadd thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) ~M~0)))), Black: 713#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) (bvslt (_ bv0 32) ~M~0) (exists ((~N~0 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), Black: 91#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_1 (_ BitVec 32))) (and (bvslt (_ bv0 32) v_subst_1) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule v_subst_1 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 1060#(or (not (bvslt (bvadd ~M~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))), 37#L85true, 110#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 29#thread3EXITtrue, 465#true, 254#(or (and (exists ((|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1)))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1)))) (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1)))))), 460#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 365#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 371#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (exists ((~N~0 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 245#(and (exists ((v_subst_3 (_ BitVec 32))) (and (bvule v_subst_3 (_ bv1073741823 32)) (bvslt (_ bv0 32) v_subst_3) (= (bvmul (_ bv4 32) v_subst_3) (select |#length| ~A~0.base)))) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 239#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)))]) [2023-11-29 00:01:37,192 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 00:01:37,192 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 00:01:37,192 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 00:01:37,193 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 00:01:37,193 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L49-->L48-6: Formula: (let ((.cse2 (bvmul (_ bv4 32) v_thread1Thread1of1ForFork0_~i~0_9))) (let ((.cse0 (bvadd v_~A~0.offset_17 (_ bv4 32) .cse2)) (.cse3 (bvadd v_~A~0.offset_17 .cse2))) (and (bvule .cse0 (select |v_#length_39| v_~A~0.base_20)) (= (bvadd (let ((.cse1 (select |v_#memory_int#3_14| v_~A~0.base_20))) (concat (concat (concat (select .cse1 (bvadd v_~A~0.offset_17 (_ bv3 32) .cse2)) (select .cse1 (bvadd v_~A~0.offset_17 (_ bv2 32) .cse2))) (select .cse1 (bvadd v_~A~0.offset_17 .cse2 (_ bv1 32)))) (select .cse1 .cse3))) v_~sum1~0_22) v_~sum1~0_21) (bvule .cse3 .cse0) (= (_ bv0 1) (bvadd (select |v_#valid_50| v_~A~0.base_20) (_ bv1 1))) (= (bvadd (_ bv1 32) v_thread1Thread1of1ForFork0_~i~0_9) v_thread1Thread1of1ForFork0_~i~0_10) (bvule (_ bv0 32) .cse3)))) InVars {~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_17, ~sum1~0=v_~sum1~0_22, #valid=|v_#valid_50|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9, #length=|v_#length_39|, #memory_int#3=|v_#memory_int#3_14|} OutVars{~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_1|, ~A~0.offset=v_~A~0.offset_17, ~sum1~0=v_~sum1~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, #valid=|v_#valid_50|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_10, #length=|v_#length_39|, #memory_int#3=|v_#memory_int#3_14|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, ~sum1~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0][505], [Black: 1279#(and (or (not (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 1281#(and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 1271#(and (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv20 32))) (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv20 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 1275#(and (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)))) (or (and (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base))))), Black: 1277#(and (or (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32))) (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), 164#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1172#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ bv1073741823 32)) (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|)))) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 1179#(and (= thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ bv1073741823 32)) (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|)))) (= ~A~0.offset (_ bv0 32))), 1361#true, Black: 136#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 154#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 150#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_2 (_ BitVec 32))) (and (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)) (bvslt (_ bv1 32) v_subst_2))) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 1137#true, 100#(or (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))))), 1323#(and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsge ~M~0 (_ bv0 32))), 726#true, Black: 560#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 556#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 282#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), Black: 506#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 552#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 206#(= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)), Black: 548#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_5 (_ BitVec 32))) (and (bvslt (_ bv4 32) v_subst_5) (bvule v_subst_5 (_ bv1073741823 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_5)))) (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 564#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 713#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) (bvslt (_ bv0 32) ~M~0) (exists ((~N~0 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), 843#true, Black: 837#(and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))), Black: 835#(and (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))) (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))) (not (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0)))), Black: 869#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ BitVec 32))) (and (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 961#(and (or (and (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 967#(and (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 876#(and (= thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ BitVec 32))) (and (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), Black: 460#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 452#(and (= thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (exists ((v_subst_4 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) v_subst_4) (select |#length| ~A~0.base)) (bvslt (_ bv1 32) v_subst_4) (bvule v_subst_4 (_ bv1073741823 32))))), Black: 324#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 965#(and (or (not (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32))) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 969#(and (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)))) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 314#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), Black: 456#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), 183#(or (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))), Black: 721#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))), Black: 717#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt (bvadd thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) ~M~0)))), Black: 91#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_1 (_ BitVec 32))) (and (bvslt (_ bv0 32) v_subst_1) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule v_subst_1 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 1060#(or (not (bvslt (bvadd ~M~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))), 37#L85true, 110#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 29#thread3EXITtrue, 465#true, 254#(or (and (exists ((|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1)))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1)))) (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1)))))), 38#L57true, Black: 365#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), 390#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32))), Black: 371#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (exists ((~N~0 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 245#(and (exists ((v_subst_3 (_ BitVec 32))) (and (bvule v_subst_3 (_ bv1073741823 32)) (bvslt (_ bv0 32) v_subst_3) (= (bvmul (_ bv4 32) v_subst_3) (select |#length| ~A~0.base)))) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 35#L48-6true, Black: 239#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32)))]) [2023-11-29 00:01:37,193 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 00:01:37,193 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 00:01:37,193 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 00:01:37,193 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 00:01:38,682 INFO L124 PetriNetUnfolderBase]: 31896/46879 cut-off events. [2023-11-29 00:01:38,682 INFO L125 PetriNetUnfolderBase]: For 381163/389321 co-relation queries the response was YES. [2023-11-29 00:01:39,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264731 conditions, 46879 events. 31896/46879 cut-off events. For 381163/389321 co-relation queries the response was YES. Maximal size of possible extension queue 1341. Compared 321699 event pairs, 9464 based on Foata normal form. 2209/45467 useless extension candidates. Maximal degree in co-relation 264675. Up to 19459 conditions per place. [2023-11-29 00:01:39,493 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 624 selfloop transitions, 124 changer transitions 0/781 dead transitions. [2023-11-29 00:01:39,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 781 transitions, 9826 flow [2023-11-29 00:01:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 00:01:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-29 00:01:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 951 transitions. [2023-11-29 00:01:39,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7423887587822015 [2023-11-29 00:01:39,496 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 951 transitions. [2023-11-29 00:01:39,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 951 transitions. [2023-11-29 00:01:39,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:39,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 951 transitions. [2023-11-29 00:01:39,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 45.285714285714285) internal successors, (951), 21 states have internal predecessors, (951), 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 00:01:39,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 61.0) internal successors, (1342), 22 states have internal predecessors, (1342), 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 00:01:39,501 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 61.0) internal successors, (1342), 22 states have internal predecessors, (1342), 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 00:01:39,501 INFO L175 Difference]: Start difference. First operand has 180 places, 237 transitions, 2747 flow. Second operand 21 states and 951 transitions. [2023-11-29 00:01:39,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 781 transitions, 9826 flow [2023-11-29 00:01:40,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 781 transitions, 9296 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:01:40,777 INFO L231 Difference]: Finished difference. Result has 204 places, 285 transitions, 3579 flow [2023-11-29 00:01:40,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=2559, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3579, PETRI_PLACES=204, PETRI_TRANSITIONS=285} [2023-11-29 00:01:40,778 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 141 predicate places. [2023-11-29 00:01:40,778 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 285 transitions, 3579 flow [2023-11-29 00:01:40,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 36.333333333333336) internal successors, (763), 21 states have internal predecessors, (763), 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 00:01:40,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:40,779 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:40,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:01:40,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:01:40,979 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 00:01:40,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1838087907, now seen corresponding path program 4 times [2023-11-29 00:01:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:01:40,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203513220] [2023-11-29 00:01:40,980 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:01:40,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:01:40,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:01:40,981 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:01:40,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Waiting until timeout for monitored process [2023-11-29 00:01:41,111 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:01:41,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:01:41,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 00:01:41,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:01:41,133 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 8 treesize of output 7 [2023-11-29 00:01:41,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:41,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,152 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 8 treesize of output 1 [2023-11-29 00:01:41,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:41,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:01:41,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:41,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:41,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,206 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 8 treesize of output 1 [2023-11-29 00:01:41,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:01:41,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:41,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,238 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 8 treesize of output 1 [2023-11-29 00:01:41,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:41,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:01:41,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:41,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-29 00:01:41,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:01:41,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:01:41,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:41,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,355 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 8 treesize of output 1 [2023-11-29 00:01:41,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:41,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:41,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,373 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 8 treesize of output 1 [2023-11-29 00:01:41,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:01:41,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:01:41,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:01:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:01:41,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:01:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:01:43,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:01:43,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203513220] [2023-11-29 00:01:43,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203513220] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:01:43,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:01:43,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-11-29 00:01:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457545397] [2023-11-29 00:01:43,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:01:43,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 00:01:43,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:01:43,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 00:01:43,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:01:50,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2023-11-29 00:01:50,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 285 transitions, 3579 flow. Second operand has 18 states, 18 states have (on average 35.77777777777778) internal successors, (644), 18 states have internal predecessors, (644), 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 00:01:50,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:50,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2023-11-29 00:01:50,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:02:17,006 INFO L124 PetriNetUnfolderBase]: 55077/76793 cut-off events. [2023-11-29 00:02:17,006 INFO L125 PetriNetUnfolderBase]: For 614534/631168 co-relation queries the response was YES. [2023-11-29 00:02:17,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429267 conditions, 76793 events. 55077/76793 cut-off events. For 614534/631168 co-relation queries the response was YES. Maximal size of possible extension queue 1386. Compared 489418 event pairs, 6943 based on Foata normal form. 6568/80157 useless extension candidates. Maximal degree in co-relation 429202. Up to 30414 conditions per place. [2023-11-29 00:02:18,240 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 1224 selfloop transitions, 150 changer transitions 10/1411 dead transitions. [2023-11-29 00:02:18,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1411 transitions, 17579 flow [2023-11-29 00:02:18,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 00:02:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-29 00:02:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1147 transitions. [2023-11-29 00:02:18,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7521311475409836 [2023-11-29 00:02:18,243 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1147 transitions. [2023-11-29 00:02:18,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1147 transitions. [2023-11-29 00:02:18,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:02:18,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1147 transitions. [2023-11-29 00:02:18,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 45.88) internal successors, (1147), 25 states have internal predecessors, (1147), 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 00:02:18,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 61.0) internal successors, (1586), 26 states have internal predecessors, (1586), 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 00:02:18,248 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 61.0) internal successors, (1586), 26 states have internal predecessors, (1586), 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 00:02:18,248 INFO L175 Difference]: Start difference. First operand has 204 places, 285 transitions, 3579 flow. Second operand 25 states and 1147 transitions. [2023-11-29 00:02:18,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 1411 transitions, 17579 flow [2023-11-29 00:02:20,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 1411 transitions, 17513 flow, removed 27 selfloop flow, removed 4 redundant places. [2023-11-29 00:02:20,941 INFO L231 Difference]: Finished difference. Result has 230 places, 308 transitions, 4151 flow [2023-11-29 00:02:20,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=3499, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4151, PETRI_PLACES=230, PETRI_TRANSITIONS=308} [2023-11-29 00:02:20,942 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 167 predicate places. [2023-11-29 00:02:20,942 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 308 transitions, 4151 flow [2023-11-29 00:02:20,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 35.77777777777778) internal successors, (644), 18 states have internal predecessors, (644), 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 00:02:20,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:02:20,943 INFO L208 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1] [2023-11-29 00:02:20,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 00:02:21,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:02:21,143 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 00:02:21,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:02:21,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1336634509, now seen corresponding path program 3 times [2023-11-29 00:02:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:02:21,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73938392] [2023-11-29 00:02:21,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:02:21,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:02:21,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:02:21,146 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:02:21,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:02:21,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-29 00:02:21,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:02:21,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 00:02:21,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:02:21,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-29 00:02:21,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:02:21,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:02:21,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,462 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 8 treesize of output 1 [2023-11-29 00:02:21,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:02:21,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:02:21,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:02:21,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:02:21,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,530 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 8 treesize of output 1 [2023-11-29 00:02:21,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:02:21,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:02:21,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,557 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 8 treesize of output 1 [2023-11-29 00:02:21,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-29 00:02:21,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:02:21,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:02:21,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:02:21,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:02:21,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:02:21,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,679 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 8 treesize of output 1 [2023-11-29 00:02:21,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:02:21,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,697 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 8 treesize of output 1 [2023-11-29 00:02:21,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:02:21,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:02:21,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:02:21,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:02:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:22,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:02:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:02:25,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:02:25,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73938392] [2023-11-29 00:02:25,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73938392] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:02:25,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:02:25,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2023-11-29 00:02:25,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742004218] [2023-11-29 00:02:25,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:02:25,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 00:02:25,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:02:25,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 00:02:25,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2023-11-29 00:02:38,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-29 00:02:38,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 308 transitions, 4151 flow. Second operand has 26 states, 26 states have (on average 36.76923076923077) internal successors, (956), 26 states have internal predecessors, (956), 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 00:02:38,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:02:38,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-29 00:02:38,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:03:23,539 INFO L124 PetriNetUnfolderBase]: 49093/70565 cut-off events. [2023-11-29 00:03:23,539 INFO L125 PetriNetUnfolderBase]: For 726866/741092 co-relation queries the response was YES. [2023-11-29 00:03:24,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442223 conditions, 70565 events. 49093/70565 cut-off events. For 726866/741092 co-relation queries the response was YES. Maximal size of possible extension queue 1495. Compared 476169 event pairs, 26822 based on Foata normal form. 1093/64549 useless extension candidates. Maximal degree in co-relation 442151. Up to 58636 conditions per place. [2023-11-29 00:03:24,709 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 237 selfloop transitions, 67 changer transitions 0/344 dead transitions. [2023-11-29 00:03:24,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 344 transitions, 5179 flow [2023-11-29 00:03:24,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-29 00:03:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-11-29 00:03:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 1712 transitions. [2023-11-29 00:03:24,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6101211689237348 [2023-11-29 00:03:24,713 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 1712 transitions. [2023-11-29 00:03:24,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 1712 transitions. [2023-11-29 00:03:24,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:03:24,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 1712 transitions. [2023-11-29 00:03:24,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 37.21739130434783) internal successors, (1712), 46 states have internal predecessors, (1712), 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 00:03:24,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 61.0) internal successors, (2867), 47 states have internal predecessors, (2867), 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 00:03:24,722 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 61.0) internal successors, (2867), 47 states have internal predecessors, (2867), 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 00:03:24,722 INFO L175 Difference]: Start difference. First operand has 230 places, 308 transitions, 4151 flow. Second operand 46 states and 1712 transitions. [2023-11-29 00:03:24,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 344 transitions, 5179 flow [2023-11-29 00:03:27,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 344 transitions, 4726 flow, removed 103 selfloop flow, removed 11 redundant places. [2023-11-29 00:03:27,311 INFO L231 Difference]: Finished difference. Result has 276 places, 344 transitions, 4306 flow [2023-11-29 00:03:27,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=3722, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=4306, PETRI_PLACES=276, PETRI_TRANSITIONS=344} [2023-11-29 00:03:27,312 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 213 predicate places. [2023-11-29 00:03:27,312 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 344 transitions, 4306 flow [2023-11-29 00:03:27,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 36.76923076923077) internal successors, (956), 26 states have internal predecessors, (956), 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 00:03:27,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:03:27,312 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:03:27,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:03:27,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:27,513 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 00:03:27,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:03:27,513 INFO L85 PathProgramCache]: Analyzing trace with hash -926566460, now seen corresponding path program 3 times [2023-11-29 00:03:27,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:03:27,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057198789] [2023-11-29 00:03:27,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:03:27,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:03:27,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:03:27,515 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:03:27,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Waiting until timeout for monitored process [2023-11-29 00:03:27,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 00:03:27,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:03:27,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 00:03:27,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:03:27,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-29 00:03:27,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:03:27,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:03:27,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:03:27,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,847 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 8 treesize of output 1 [2023-11-29 00:03:27,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:03:27,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:03:27,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:03:27,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,892 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 8 treesize of output 1 [2023-11-29 00:03:27,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:03:27,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 00:03:27,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:03:27,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,922 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 8 treesize of output 1 [2023-11-29 00:03:27,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:03:27,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:03:27,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:03:27,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,964 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 8 treesize of output 1 [2023-11-29 00:03:27,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:03:27,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:03:27,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:27,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:03:28,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:28,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:03:28,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:28,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-29 00:03:28,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:28,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:03:28,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:03:28,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:03:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:28,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:03:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:03:31,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:03:31,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057198789] [2023-11-29 00:03:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057198789] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:03:31,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:03:31,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2023-11-29 00:03:31,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358456127] [2023-11-29 00:03:31,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:03:31,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 00:03:31,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:03:31,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 00:03:31,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2023-11-29 00:03:44,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-29 00:03:44,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 344 transitions, 4306 flow. Second operand has 21 states, 21 states have (on average 36.523809523809526) internal successors, (767), 21 states have internal predecessors, (767), 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 00:03:44,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:03:44,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-29 00:03:44,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:04:03,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L49-->L48-6: Formula: (let ((.cse2 (bvmul (_ bv4 32) v_thread1Thread1of1ForFork0_~i~0_9))) (let ((.cse0 (bvadd v_~A~0.offset_17 (_ bv4 32) .cse2)) (.cse3 (bvadd v_~A~0.offset_17 .cse2))) (and (bvule .cse0 (select |v_#length_39| v_~A~0.base_20)) (= (bvadd (let ((.cse1 (select |v_#memory_int#3_14| v_~A~0.base_20))) (concat (concat (concat (select .cse1 (bvadd v_~A~0.offset_17 (_ bv3 32) .cse2)) (select .cse1 (bvadd v_~A~0.offset_17 (_ bv2 32) .cse2))) (select .cse1 (bvadd v_~A~0.offset_17 .cse2 (_ bv1 32)))) (select .cse1 .cse3))) v_~sum1~0_22) v_~sum1~0_21) (bvule .cse3 .cse0) (= (_ bv0 1) (bvadd (select |v_#valid_50| v_~A~0.base_20) (_ bv1 1))) (= (bvadd (_ bv1 32) v_thread1Thread1of1ForFork0_~i~0_9) v_thread1Thread1of1ForFork0_~i~0_10) (bvule (_ bv0 32) .cse3)))) InVars {~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_17, ~sum1~0=v_~sum1~0_22, #valid=|v_#valid_50|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9, #length=|v_#length_39|, #memory_int#3=|v_#memory_int#3_14|} OutVars{~A~0.base=v_~A~0.base_20, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_1|, ~A~0.offset=v_~A~0.offset_17, ~sum1~0=v_~sum1~0_21, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, #valid=|v_#valid_50|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_10, #length=|v_#length_39|, #memory_int#3=|v_#memory_int#3_14|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, ~sum1~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0][455], [Black: 1279#(and (or (not (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 1281#(and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 1271#(and (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv20 32))) (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv20 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 1275#(and (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)))) (or (and (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base))))), Black: 1277#(and (or (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32))) (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), 164#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1172#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ bv1073741823 32)) (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|)))) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 1179#(and (= thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ bv1073741823 32)) (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|)))) (= ~A~0.offset (_ bv0 32))), 1361#true, Black: 1898#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv10 32)) (exists ((v_subst_24 (_ BitVec 32))) (and (bvule v_subst_24 (_ bv1073741823 32)) (= (bvmul v_subst_24 (_ bv4 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvslt (_ bv10 32) v_subst_24))) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 1906#(and (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv40 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv40 32)))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv9 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv7 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv5 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1934#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1922#(and (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv5 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1902#(and (or (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv40 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv10 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv44 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv40 32)) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv44 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv40 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv40 32)))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv9 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv7 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv5 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1938#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1930#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1802#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1914#(and (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv7 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv5 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 136#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1910#(and (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv7 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv5 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 154#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1918#(and (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv5 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 150#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_2 (_ BitVec 32))) (and (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)) (bvslt (_ bv1 32) v_subst_2))) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 1926#(and (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 1137#true, 100#(or (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))))), 726#true, Black: 1707#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 1703#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) ~N~0)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv2 32)) ~N~0)) (and (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)))))), Black: 1691#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (exists ((v_subst_23 (_ BitVec 32))) (and (bvule v_subst_23 (_ bv1073741823 32)) (= (bvmul v_subst_23 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv4 32) v_subst_23))) (= thread1Thread1of1ForFork0_~i~0 (_ bv4 32))), Black: 1711#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 1699#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) ~N~0)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))) (= ~A~0.offset (_ bv0 32)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv2 32)) ~N~0)) (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)))) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv3 32)) ~N~0)) (and (bvule (bvadd (_ bv16 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))))), Black: 560#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1695#(and (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) ~N~0)) (and (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv16 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32))))) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) ~N~0)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))) (= ~A~0.offset (_ bv0 32)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv2 32)) ~N~0)) (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)))) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv3 32)) ~N~0)) (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))))), Black: 556#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 282#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), Black: 506#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 552#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 548#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_5 (_ BitVec 32))) (and (bvslt (_ bv4 32) v_subst_5) (bvule v_subst_5 (_ bv1073741823 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_5)))) (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 206#(= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)), Black: 564#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 713#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) (bvslt (_ bv0 32) ~M~0) (exists ((~N~0 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), 843#true, Black: 837#(and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))), Black: 835#(and (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))) (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))) (not (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0)))), Black: 869#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ BitVec 32))) (and (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 961#(and (or (and (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 967#(and (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 460#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 876#(and (= thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ BitVec 32))) (and (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), Black: 452#(and (= thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (exists ((v_subst_4 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) v_subst_4) (select |#length| ~A~0.base)) (bvslt (_ bv1 32) v_subst_4) (bvule v_subst_4 (_ bv1073741823 32))))), Black: 965#(and (or (not (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32))) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 324#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 969#(and (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)))) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 456#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 314#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), 183#(or (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))), Black: 721#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))), Black: 717#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt (bvadd thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) ~M~0)))), Black: 91#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_1 (_ BitVec 32))) (and (bvslt (_ bv0 32) v_subst_1) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule v_subst_1 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 1060#(or (not (bvslt (bvadd ~M~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))), 1601#(and (bvule (_ bv16 32) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv4 32))), 37#L85true, 110#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 29#thread3EXITtrue, 1952#true, 1719#true, 465#true, 254#(or (and (exists ((|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1)))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1)))) (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1)))))), 38#L57true, Black: 1394#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_73| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_73|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_73| (_ bv1073741823 32)) (not (bvslt (_ bv2 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_73|)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 1507#(and (or (not (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (bvadd ~A~0.offset (_ bv24 32))) (bvule (bvadd ~A~0.offset (_ bv24 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))))) (or (not (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)))) (and (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv24 32)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv24 32)))))), Black: 1503#(and (or (not (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)))) (not (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)))) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_73| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_73|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_73| (_ bv1073741823 32)) (not (bvslt (_ bv2 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_73|)))) (or (not (bvule (bvadd (_ bv16 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)))) (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv24 32)) (select |#length| ~A~0.base)) (not (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))))) (= ~A~0.offset (_ bv0 32)) (or (not (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))))) (or (not (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))) (not (bvule (bvadd (_ bv16 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))))), Black: 1515#(and (or (not (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (bvadd ~A~0.offset (_ bv24 32))) (bvule (bvadd ~A~0.offset (_ bv24 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))))) (or (not (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32))) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))))), Black: 365#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 1517#(and (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))))) (or (not (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (bvadd ~A~0.offset (_ bv24 32))) (bvule (bvadd ~A~0.offset (_ bv24 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32)))))), Black: 1519#(and (or (not (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (bvadd ~A~0.offset (_ bv24 32))) (bvule (bvadd ~A~0.offset (_ bv24 32)) (select |#length| ~A~0.base)))) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 371#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (exists ((~N~0 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 1511#(and (or (and (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)))) (not (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (bvadd ~A~0.offset (_ bv24 32))) (bvule (bvadd ~A~0.offset (_ bv24 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32)))))), Black: 245#(and (exists ((v_subst_3 (_ BitVec 32))) (and (bvule v_subst_3 (_ bv1073741823 32)) (bvslt (_ bv0 32) v_subst_3) (= (bvmul (_ bv4 32) v_subst_3) (select |#length| ~A~0.base)))) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), 35#L48-6true, Black: 1513#(and (or (not (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (bvadd ~A~0.offset (_ bv24 32))) (bvule (bvadd ~A~0.offset (_ bv24 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))))) (or (not (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)))) (and (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base))))), Black: 239#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 1477#(or (not (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (bvadd ~A~0.offset (_ bv24 32))) (bvule (bvadd ~A~0.offset (_ bv24 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32)))))]) [2023-11-29 00:04:03,396 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 00:04:03,396 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 00:04:03,396 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 00:04:03,396 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 00:04:03,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([441] L57-->L56-6: Formula: (let ((.cse3 (bvmul (_ bv4 32) v_thread2Thread1of1ForFork2_~i~1_9))) (let ((.cse0 (bvadd v_~A~0.offset_27 .cse3)) (.cse1 (bvadd v_~A~0.offset_27 (_ bv4 32) .cse3))) (and (bvule .cse0 .cse1) (= (bvadd (_ bv1 1) (select |v_#valid_60| v_~A~0.base_30)) (_ bv0 1)) (bvule (_ bv0 32) .cse0) (= v_thread2Thread1of1ForFork2_~i~1_10 (bvadd v_thread2Thread1of1ForFork2_~i~1_9 (_ bv1 32))) (= v_~sum2~0_21 (bvadd v_~sum2~0_22 (let ((.cse2 (select |v_#memory_int#3_24| v_~A~0.base_30))) (concat (concat (concat (select .cse2 (bvadd v_~A~0.offset_27 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~A~0.offset_27 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~A~0.offset_27 (_ bv1 32) .cse3))) (select .cse2 .cse0))))) (bvule .cse1 (select |v_#length_49| v_~A~0.base_30))))) InVars {~A~0.base=v_~A~0.base_30, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_9, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_60|, ~sum2~0=v_~sum2~0_22, #length=|v_#length_49|, #memory_int#3=|v_#memory_int#3_24|} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, ~A~0.base=v_~A~0.base_30, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_10, thread2Thread1of1ForFork2_#t~mem4=|v_thread2Thread1of1ForFork2_#t~mem4_1|, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_60|, ~sum2~0=v_~sum2~0_21, #length=|v_#length_49|, #memory_int#3=|v_#memory_int#3_24|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem4, ~sum2~0][410], [Black: 1279#(and (or (not (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 1281#(and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 1271#(and (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv20 32))) (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv20 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), 715#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (or (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (not (bvslt thread2Thread1of1ForFork2_~i~1 ~M~0))) (bvsge ~M~0 (_ bv0 32)) (or (and (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt (bvadd thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) ~M~0)))), Black: 1275#(and (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)))) (or (and (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base))))), 32#L56-6true, Black: 1277#(and (or (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32))) (bvule (bvadd ~A~0.offset (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), 164#(and (= |ULTIMATE.start_main_~#t2~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1172#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ bv1073741823 32)) (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|)))) (= ~A~0.offset (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 1179#(and (= thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72| (_ bv1073741823 32)) (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_72|)))) (= ~A~0.offset (_ bv0 32))), 1361#true, Black: 1898#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv10 32)) (exists ((v_subst_24 (_ BitVec 32))) (and (bvule v_subst_24 (_ bv1073741823 32)) (= (bvmul v_subst_24 (_ bv4 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvslt (_ bv10 32) v_subst_24))) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 1906#(and (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv40 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv40 32)))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv9 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv7 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv5 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1934#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1922#(and (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv5 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1902#(and (or (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv40 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv10 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv44 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv40 32)) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv44 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv40 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv40 32)))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv9 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv7 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv5 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1938#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1930#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1802#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1914#(and (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv7 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv5 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 136#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1910#(and (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv7 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv5 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv36 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv32 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (or (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 154#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1918#(and (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv5 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv24 32)) (bvadd (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 150#(and (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_2 (_ BitVec 32))) (and (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_2)) (bvule v_subst_2 (_ bv1073741823 32)) (bvslt (_ bv1 32) v_subst_2))) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), Black: 1926#(and (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (not (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 1137#true, 100#(or (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)))))), 726#true, Black: 1707#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 1703#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) ~N~0)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv2 32)) ~N~0)) (and (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)))))), Black: 1691#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (exists ((v_subst_23 (_ BitVec 32))) (and (bvule v_subst_23 (_ bv1073741823 32)) (= (bvmul v_subst_23 (_ bv4 32)) (select |#length| ~A~0.base)) (bvslt (_ bv4 32) v_subst_23))) (= thread1Thread1of1ForFork0_~i~0 (_ bv4 32))), Black: 1711#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 1699#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) ~N~0)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))) (= ~A~0.offset (_ bv0 32)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv2 32)) ~N~0)) (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)))) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv3 32)) ~N~0)) (and (bvule (bvadd (_ bv16 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))))), Black: 560#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 1695#(and (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) ~N~0)) (and (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv16 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32))))) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) ~N~0)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))) (= ~A~0.offset (_ bv0 32)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv2 32)) ~N~0)) (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)))) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv3 32)) ~N~0)) (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))))), Black: 556#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 282#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_main_~#t3~0#1.offset| (_ bv0 32))), Black: 506#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 552#(and (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (or (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (and (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (_ bv20 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), Black: 548#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_5 (_ BitVec 32))) (and (bvslt (_ bv4 32) v_subst_5) (bvule v_subst_5 (_ bv1073741823 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) v_subst_5)))) (= (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 206#(= (bvadd (select |#valid| ~A~0.base) (_ bv1 1)) (_ bv0 1)), Black: 564#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv1 32)) |ULTIMATE.start_create_fresh_uint_array_~size#1|))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|))), 843#true, Black: 837#(and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))), Black: 835#(and (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))) (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread3Thread1of1ForFork1_~i~2 (_ bv4 32))))) (not (bvslt thread3Thread1of1ForFork1_~i~2 ~N~0)))), 50#L49true, Black: 869#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ BitVec 32))) (and (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 961#(and (or (and (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 967#(and (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 876#(and (= thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ BitVec 32))) (and (not (bvslt (_ bv1 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_70| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), Black: 324#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 452#(and (= thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (exists ((v_subst_4 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) v_subst_4) (select |#length| ~A~0.base)) (bvslt (_ bv1 32) v_subst_4) (bvule v_subst_4 (_ bv1073741823 32))))), Black: 965#(and (or (not (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32))) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))))), Black: 314#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ BitVec 32))) (and (not (bvslt (_ bv0 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|)) (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_67| (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), Black: 969#(and (or (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (select |#length| ~A~0.base))) (and (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))) (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base)))) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 456#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (or (not (bvslt (bvadd thread1Thread1of1ForFork0_~i~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), 183#(or (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t3~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1))))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (and (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)))))), Black: 721#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))), Black: 717#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (bvule (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base)) (or (and (bvule (bvadd (_ bv4 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul thread2Thread1of1ForFork2_~i~1 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvslt (bvadd thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) ~M~0)))), Black: 713#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= thread2Thread1of1ForFork2_~i~1 (_ bv1 32)) (bvslt (_ bv0 32) ~M~0) (exists ((~N~0 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32))), 1689#(and (bvule (_ bv16 32) (select |#length| ~A~0.base)) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv3 32))), Black: 91#(and (= (_ bv0 32) |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_create_fresh_uint_array_~size#1|)) (exists ((v_subst_1 (_ BitVec 32))) (and (bvslt (_ bv0 32) v_subst_1) (= (bvmul (_ bv4 32) v_subst_1) (select |#length| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (bvule v_subst_1 (_ bv1073741823 32)))) (bvule |ULTIMATE.start_create_fresh_uint_array_~size#1| (_ bv1073741823 32))), 1060#(or (not (bvslt (bvadd ~M~0 (_ bv1 32)) ~N~0)) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul (_ bv4 32) ~M~0)) (bvadd ~A~0.offset (_ bv8 32) (bvmul (_ bv4 32) ~M~0)))) (not (bvslt ~M~0 ~N~0))), 37#L85true, 110#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| (_ bv0 32))), 29#thread3EXITtrue, 1952#true, 1719#true, 465#true, 254#(or (and (exists ((|ULTIMATE.start_main_~#t1~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) (_ bv1 1)))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1)))) (and (exists ((|ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (_ BitVec 32))) (= (bvadd (select |#valid| |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) (_ bv1 1))) (exists ((|ULTIMATE.start_main_~#t2~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) (_ bv1 1)))))), Black: 1394#(and (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_73| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_73|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_73| (_ bv1073741823 32)) (not (bvslt (_ bv2 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_73|)))) (= ~A~0.offset (_ bv0 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 1507#(and (or (not (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (bvadd ~A~0.offset (_ bv24 32))) (bvule (bvadd ~A~0.offset (_ bv24 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))))) (or (not (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)))) (and (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv24 32)) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv24 32)))))), Black: 1503#(and (or (not (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)))) (not (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base)))) (exists ((|v_ULTIMATE.start_create_fresh_uint_array_~size#1_73| (_ BitVec 32))) (and (= (bvmul (_ bv4 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_73|) (select |#length| ~A~0.base)) (bvule |v_ULTIMATE.start_create_fresh_uint_array_~size#1_73| (_ bv1073741823 32)) (not (bvslt (_ bv2 32) |v_ULTIMATE.start_create_fresh_uint_array_~size#1_73|)))) (or (not (bvule (bvadd (_ bv16 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)))) (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv24 32)) (select |#length| ~A~0.base)) (not (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))))) (= ~A~0.offset (_ bv0 32)) (or (not (bvule (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv4 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))))) (or (not (bvule (bvadd (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))) (not (bvule (bvadd (_ bv16 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))))), Black: 1515#(and (or (not (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (bvadd ~A~0.offset (_ bv24 32))) (bvule (bvadd ~A~0.offset (_ bv24 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))))) (or (not (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32))) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))))), Black: 1517#(and (or (and (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))))) (or (not (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (bvadd ~A~0.offset (_ bv24 32))) (bvule (bvadd ~A~0.offset (_ bv24 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32)))))), Black: 365#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 1519#(and (or (not (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (bvadd ~A~0.offset (_ bv24 32))) (bvule (bvadd ~A~0.offset (_ bv24 32)) (select |#length| ~A~0.base)))) (bvule (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)) (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd (_ bv4 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))), Black: 371#(and (exists ((~N~0 (_ BitVec 32))) (and (bvsle ~M~0 ~N~0) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvule ~N~0 (_ bv1073741823 32)))) (exists ((~N~0 (_ BitVec 32))) (and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (bvslt (_ bv0 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))) (= ~A~0.offset (_ bv0 32)) (bvsge ~M~0 (_ bv0 32)) (= thread2Thread1of1ForFork2_~i~1 (_ bv0 32))), Black: 1511#(and (or (and (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)) (select |#length| ~A~0.base)) (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv20 32)))) (not (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base)))) (or (not (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (bvadd ~A~0.offset (_ bv24 32))) (bvule (bvadd ~A~0.offset (_ bv24 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32)))))), Black: 245#(and (exists ((v_subst_3 (_ BitVec 32))) (and (bvule v_subst_3 (_ bv1073741823 32)) (bvslt (_ bv0 32) v_subst_3) (= (bvmul (_ bv4 32) v_subst_3) (select |#length| ~A~0.base)))) (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 239#(and (= (bvmul (_ bv4 32) ~N~0) (select |#length| ~A~0.base)) (= ~A~0.offset (_ bv0 32)) (bvule ~N~0 (_ bv1073741823 32)) (= thread1Thread1of1ForFork0_~i~0 (_ bv0 32))), Black: 1513#(and (or (not (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (bvadd ~A~0.offset (_ bv24 32))) (bvule (bvadd ~A~0.offset (_ bv24 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32))))) (or (not (bvule (bvadd ~A~0.offset (_ bv8 32) (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)))) (and (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32))) (select |#length| ~A~0.base))) (not (bvule (bvadd ~A~0.offset (bvmul thread1Thread1of1ForFork0_~i~0 (_ bv4 32)) (_ bv12 32)) (select |#length| ~A~0.base))))), Black: 1477#(or (not (bvule (bvadd ~A~0.offset (_ bv20 32)) (select |#length| ~A~0.base))) (and (bvule (bvadd ~A~0.offset (_ bv20 32)) (bvadd ~A~0.offset (_ bv24 32))) (bvule (bvadd ~A~0.offset (_ bv24 32)) (select |#length| ~A~0.base))) (not (bvule (bvadd (_ bv16 32) ~A~0.offset) (bvadd ~A~0.offset (_ bv20 32)))))]) [2023-11-29 00:04:03,397 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 00:04:03,397 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 00:04:03,398 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 00:04:03,398 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 00:04:11,854 INFO L124 PetriNetUnfolderBase]: 55227/79140 cut-off events. [2023-11-29 00:04:11,854 INFO L125 PetriNetUnfolderBase]: For 690033/703972 co-relation queries the response was YES. [2023-11-29 00:04:12,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440876 conditions, 79140 events. 55227/79140 cut-off events. For 690033/703972 co-relation queries the response was YES. Maximal size of possible extension queue 1670. Compared 538876 event pairs, 16706 based on Foata normal form. 3671/75969 useless extension candidates. Maximal degree in co-relation 440792. Up to 33271 conditions per place. [2023-11-29 00:04:13,438 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 726 selfloop transitions, 108 changer transitions 0/874 dead transitions. [2023-11-29 00:04:13,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 874 transitions, 11481 flow [2023-11-29 00:04:13,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 00:04:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-29 00:04:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 900 transitions. [2023-11-29 00:04:13,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7377049180327869 [2023-11-29 00:04:13,442 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 900 transitions. [2023-11-29 00:04:13,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 900 transitions. [2023-11-29 00:04:13,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:04:13,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 900 transitions. [2023-11-29 00:04:13,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 45.0) internal successors, (900), 20 states have internal predecessors, (900), 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 00:04:13,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 61.0) internal successors, (1281), 21 states have internal predecessors, (1281), 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 00:04:13,446 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 61.0) internal successors, (1281), 21 states have internal predecessors, (1281), 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 00:04:13,447 INFO L175 Difference]: Start difference. First operand has 276 places, 344 transitions, 4306 flow. Second operand 20 states and 900 transitions. [2023-11-29 00:04:13,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 874 transitions, 11481 flow [2023-11-29 00:04:16,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 874 transitions, 11309 flow, removed 55 selfloop flow, removed 21 redundant places. [2023-11-29 00:04:16,366 INFO L231 Difference]: Finished difference. Result has 282 places, 366 transitions, 4698 flow [2023-11-29 00:04:16,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=4000, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4698, PETRI_PLACES=282, PETRI_TRANSITIONS=366} [2023-11-29 00:04:16,367 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 219 predicate places. [2023-11-29 00:04:16,367 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 366 transitions, 4698 flow [2023-11-29 00:04:16,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 36.523809523809526) internal successors, (767), 21 states have internal predecessors, (767), 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 00:04:16,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:04:16,367 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:04:16,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 00:04:16,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:04:16,568 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 00:04:16,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:04:16,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1043693464, now seen corresponding path program 4 times [2023-11-29 00:04:16,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:04:16,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603923914] [2023-11-29 00:04:16,569 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:04:16,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:04:16,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:04:16,570 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:04:16,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:04:16,713 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:04:16,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:04:16,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 00:04:16,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:04:16,734 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 8 treesize of output 7 [2023-11-29 00:04:16,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:04:16,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,753 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 8 treesize of output 1 [2023-11-29 00:04:16,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:04:16,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:04:16,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:04:16,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,798 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 8 treesize of output 1 [2023-11-29 00:04:16,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:04:16,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,813 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 8 treesize of output 1 [2023-11-29 00:04:16,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:04:16,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:04:16,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:04:16,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:04:16,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:04:16,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:04:16,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:04:16,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:04:16,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-29 00:04:16,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:04:16,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-29 00:04:16,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,989 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 8 treesize of output 1 [2023-11-29 00:04:16,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:16,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:04:17,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:17,004 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 8 treesize of output 1 [2023-11-29 00:04:17,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:04:17,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-29 00:04:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:04:17,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:04:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:04:19,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:04:19,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603923914] [2023-11-29 00:04:19,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603923914] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:04:19,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:04:19,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-11-29 00:04:19,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489209592] [2023-11-29 00:04:19,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:04:19,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 00:04:19,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:04:19,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 00:04:19,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:04:29,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2023-11-29 00:04:29,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 366 transitions, 4698 flow. Second operand has 18 states, 18 states have (on average 36.0) internal successors, (648), 18 states have internal predecessors, (648), 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 00:04:29,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:04:29,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2023-11-29 00:04:29,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:05:14,323 INFO L124 PetriNetUnfolderBase]: 94690/129173 cut-off events. [2023-11-29 00:05:14,323 INFO L125 PetriNetUnfolderBase]: For 1258946/1287821 co-relation queries the response was YES. [2023-11-29 00:05:15,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761734 conditions, 129173 events. 94690/129173 cut-off events. For 1258946/1287821 co-relation queries the response was YES. Maximal size of possible extension queue 1968. Compared 821668 event pairs, 14629 based on Foata normal form. 10475/134075 useless extension candidates. Maximal degree in co-relation 761642. Up to 53643 conditions per place. [2023-11-29 00:05:17,046 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 1662 selfloop transitions, 176 changer transitions 19/1891 dead transitions. [2023-11-29 00:05:17,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 1891 transitions, 24816 flow [2023-11-29 00:05:17,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 00:05:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-29 00:05:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1079 transitions. [2023-11-29 00:05:17,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7370218579234973 [2023-11-29 00:05:17,050 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1079 transitions. [2023-11-29 00:05:17,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1079 transitions. [2023-11-29 00:05:17,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:05:17,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1079 transitions. [2023-11-29 00:05:17,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 44.958333333333336) internal successors, (1079), 24 states have internal predecessors, (1079), 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 00:05:17,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 61.0) internal successors, (1525), 25 states have internal predecessors, (1525), 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 00:05:17,055 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 61.0) internal successors, (1525), 25 states have internal predecessors, (1525), 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 00:05:17,055 INFO L175 Difference]: Start difference. First operand has 282 places, 366 transitions, 4698 flow. Second operand 24 states and 1079 transitions. [2023-11-29 00:05:17,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 1891 transitions, 24816 flow [2023-11-29 00:05:24,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 1891 transitions, 24717 flow, removed 24 selfloop flow, removed 5 redundant places. [2023-11-29 00:05:24,820 INFO L231 Difference]: Finished difference. Result has 306 places, 389 transitions, 5349 flow [2023-11-29 00:05:24,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=4585, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5349, PETRI_PLACES=306, PETRI_TRANSITIONS=389} [2023-11-29 00:05:24,820 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 243 predicate places. [2023-11-29 00:05:24,820 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 389 transitions, 5349 flow [2023-11-29 00:05:24,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 36.0) internal successors, (648), 18 states have internal predecessors, (648), 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 00:05:24,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:05:24,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:05:24,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:05:25,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:05:25,021 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 00:05:25,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:05:25,022 INFO L85 PathProgramCache]: Analyzing trace with hash 350155810, now seen corresponding path program 1 times [2023-11-29 00:05:25,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:05:25,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311545813] [2023-11-29 00:05:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:05:25,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:05:25,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:05:25,023 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:05:25,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-11-29 00:05:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:05:25,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:05:25,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:05:25,293 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 00:05:25,293 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:05:25,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:05:25,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311545813] [2023-11-29 00:05:25,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311545813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:05:25,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:05:25,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:05:25,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337457631] [2023-11-29 00:05:25,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:05:25,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:05:25,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:05:25,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:05:25,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:05:25,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 61 [2023-11-29 00:05:25,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 389 transitions, 5349 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 00:05:25,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:05:25,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 61 [2023-11-29 00:05:25,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:05:54,180 INFO L124 PetriNetUnfolderBase]: 77963/114704 cut-off events. [2023-11-29 00:05:54,180 INFO L125 PetriNetUnfolderBase]: For 1202619/1219488 co-relation queries the response was YES. [2023-11-29 00:05:55,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712763 conditions, 114704 events. 77963/114704 cut-off events. For 1202619/1219488 co-relation queries the response was YES. Maximal size of possible extension queue 1715. Compared 814758 event pairs, 23335 based on Foata normal form. 2149/114285 useless extension candidates. Maximal degree in co-relation 712664. Up to 88455 conditions per place. [2023-11-29 00:05:56,662 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 362 selfloop transitions, 51 changer transitions 8/469 dead transitions. [2023-11-29 00:05:56,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 469 transitions, 7320 flow [2023-11-29 00:05:56,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:05:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:05:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 00:05:56,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8142076502732241 [2023-11-29 00:05:56,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 00:05:56,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 00:05:56,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:05:56,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 00:05:56,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 00:05:56,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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 00:05:56,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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 00:05:56,665 INFO L175 Difference]: Start difference. First operand has 306 places, 389 transitions, 5349 flow. Second operand 3 states and 149 transitions. [2023-11-29 00:05:56,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 469 transitions, 7320 flow [2023-11-29 00:06:09,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 469 transitions, 6726 flow, removed 121 selfloop flow, removed 11 redundant places. [2023-11-29 00:06:09,613 INFO L231 Difference]: Finished difference. Result has 298 places, 424 transitions, 5724 flow [2023-11-29 00:06:09,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=4821, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5724, PETRI_PLACES=298, PETRI_TRANSITIONS=424} [2023-11-29 00:06:09,614 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 235 predicate places. [2023-11-29 00:06:09,614 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 424 transitions, 5724 flow [2023-11-29 00:06:09,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 00:06:09,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:06:09,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:06:09,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2023-11-29 00:06:09,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:06:09,815 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 00:06:09,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:06:09,815 INFO L85 PathProgramCache]: Analyzing trace with hash -317356632, now seen corresponding path program 1 times [2023-11-29 00:06:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:06:09,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781720763] [2023-11-29 00:06:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:06:09,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:06:09,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:06:09,817 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:06:09,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:06:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:06:09,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:06:09,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:06:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:06:10,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:06:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:06:10,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:06:10,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781720763] [2023-11-29 00:06:10,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781720763] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:06:10,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:06:10,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-11-29 00:06:10,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423212579] [2023-11-29 00:06:10,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:06:10,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 00:06:10,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:06:10,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 00:06:10,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-11-29 00:06:10,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 61 [2023-11-29 00:06:10,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 424 transitions, 5724 flow. Second operand has 16 states, 16 states have (on average 36.25) internal successors, (580), 16 states have internal predecessors, (580), 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 00:06:10,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:06:10,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 61 [2023-11-29 00:06:10,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:07:01,525 INFO L124 PetriNetUnfolderBase]: 143916/193300 cut-off events. [2023-11-29 00:07:01,526 INFO L125 PetriNetUnfolderBase]: For 1346055/1371482 co-relation queries the response was YES. [2023-11-29 00:07:04,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1069181 conditions, 193300 events. 143916/193300 cut-off events. For 1346055/1371482 co-relation queries the response was YES. Maximal size of possible extension queue 2686. Compared 1215052 event pairs, 27995 based on Foata normal form. 5440/182975 useless extension candidates. Maximal degree in co-relation 1069081. Up to 70815 conditions per place. [2023-11-29 00:07:05,287 INFO L140 encePairwiseOnDemand]: 49/61 looper letters, 628 selfloop transitions, 442 changer transitions 13/1109 dead transitions. [2023-11-29 00:07:05,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 1109 transitions, 16210 flow [2023-11-29 00:07:05,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 00:07:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-29 00:07:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 931 transitions. [2023-11-29 00:07:05,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6937406855439643 [2023-11-29 00:07:05,290 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 931 transitions. [2023-11-29 00:07:05,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 931 transitions. [2023-11-29 00:07:05,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:07:05,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 931 transitions. [2023-11-29 00:07:05,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 42.31818181818182) internal successors, (931), 22 states have internal predecessors, (931), 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 00:07:05,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 61.0) internal successors, (1403), 23 states have internal predecessors, (1403), 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 00:07:05,294 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 61.0) internal successors, (1403), 23 states have internal predecessors, (1403), 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 00:07:05,294 INFO L175 Difference]: Start difference. First operand has 298 places, 424 transitions, 5724 flow. Second operand 22 states and 931 transitions. [2023-11-29 00:07:05,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 1109 transitions, 16210 flow [2023-11-29 00:07:26,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 1109 transitions, 15299 flow, removed 397 selfloop flow, removed 4 redundant places. [2023-11-29 00:07:26,050 INFO L231 Difference]: Finished difference. Result has 313 places, 625 transitions, 9038 flow [2023-11-29 00:07:26,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=5337, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=9038, PETRI_PLACES=313, PETRI_TRANSITIONS=625} [2023-11-29 00:07:26,052 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 250 predicate places. [2023-11-29 00:07:26,052 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 625 transitions, 9038 flow [2023-11-29 00:07:26,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 36.25) internal successors, (580), 16 states have internal predecessors, (580), 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 00:07:26,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:07:26,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:07:26,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 00:07:26,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:07:26,253 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-29 00:07:26,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:07:26,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1579947344, now seen corresponding path program 1 times [2023-11-29 00:07:26,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:07:26,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397617052] [2023-11-29 00:07:26,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:07:26,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:07:26,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:07:26,255 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:07:26,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a15c157-2abd-4474-a1eb-137f8efdf71a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-11-29 00:07:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:07:26,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 00:07:26,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:07:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:07:26,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:07:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:07:26,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:07:26,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397617052] [2023-11-29 00:07:26,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397617052] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:07:26,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:07:26,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-11-29 00:07:26,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293236941] [2023-11-29 00:07:26,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:07:26,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 00:07:26,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:07:26,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:07:26,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:07:26,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 61 [2023-11-29 00:07:26,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 625 transitions, 9038 flow. Second operand has 12 states, 12 states have (on average 37.5) internal successors, (450), 12 states have internal predecessors, (450), 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 00:07:26,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:07:26,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 61 [2023-11-29 00:07:26,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand