./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/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_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37988a2d341c7c9f3fcf434d412d9132bef9023d4105c08959698de2759206e2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:18:12,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:18:12,085 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:18:12,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:18:12,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:18:12,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:18:12,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:18:12,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:18:12,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:18:12,114 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:18:12,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:18:12,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:18:12,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:18:12,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:18:12,117 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:18:12,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:18:12,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:18:12,119 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:18:12,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:18:12,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:18:12,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:18:12,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:18:12,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:18:12,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:18:12,125 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:18:12,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:18:12,126 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:18:12,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:18:12,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:18:12,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:18:12,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:18:12,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:18:12,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:18:12,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:18:12,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:18:12,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:18:12,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:18:12,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:18:12,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:18:12,129 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:18:12,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:18:12,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:18:12,130 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_533292a0-b51c-4d17-8804-d0092f906700/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_533292a0-b51c-4d17-8804-d0092f906700/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 ! call(reach_error())) ) 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 -> 37988a2d341c7c9f3fcf434d412d9132bef9023d4105c08959698de2759206e2 [2023-11-29 00:18:12,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:18:12,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:18:12,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:18:12,361 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:18:12,361 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:18:12,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2023-11-29 00:18:15,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:18:15,271 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:18:15,272 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2023-11-29 00:18:15,280 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/data/fec57495e/c3d41c65b11348d1a7a5f24d4d8647bb/FLAGb6feaa907 [2023-11-29 00:18:15,293 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/data/fec57495e/c3d41c65b11348d1a7a5f24d4d8647bb [2023-11-29 00:18:15,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:18:15,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:18:15,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:18:15,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:18:15,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:18:15,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:18:15" (1/1) ... [2023-11-29 00:18:15,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e339de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15, skipping insertion in model container [2023-11-29 00:18:15,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:18:15" (1/1) ... [2023-11-29 00:18:15,330 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:18:15,503 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c[2874,2887] [2023-11-29 00:18:15,515 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:18:15,525 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:18:15,552 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c[2874,2887] [2023-11-29 00:18:15,557 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:18:15,566 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:18:15,567 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:18:15,575 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:18:15,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15 WrapperNode [2023-11-29 00:18:15,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:18:15,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:18:15,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:18:15,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:18:15,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15" (1/1) ... [2023-11-29 00:18:15,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15" (1/1) ... [2023-11-29 00:18:15,623 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 291 [2023-11-29 00:18:15,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:18:15,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:18:15,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:18:15,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:18:15,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15" (1/1) ... [2023-11-29 00:18:15,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15" (1/1) ... [2023-11-29 00:18:15,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15" (1/1) ... [2023-11-29 00:18:15,660 INFO L175 MemorySlicer]: Split 16 memory accesses to 5 slices as follows [2, 2, 8, 2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 5 writes are split as follows [0, 1, 2, 1, 1]. [2023-11-29 00:18:15,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15" (1/1) ... [2023-11-29 00:18:15,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15" (1/1) ... [2023-11-29 00:18:15,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15" (1/1) ... [2023-11-29 00:18:15,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15" (1/1) ... [2023-11-29 00:18:15,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15" (1/1) ... [2023-11-29 00:18:15,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15" (1/1) ... [2023-11-29 00:18:15,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:18:15,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:18:15,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:18:15,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:18:15,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15" (1/1) ... [2023-11-29 00:18:15,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:18:15,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:18:15,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:18:15,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:18:15,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:18:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:18:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:18:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:18:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:18:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:18:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 00:18:15,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:18:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:18:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 00:18:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 00:18:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 00:18:15,756 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 00:18:15,756 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 00:18:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 00:18:15,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 00:18:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 00:18:15,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 00:18:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:18:15,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:18:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:18:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:18:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 00:18:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 00:18:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 00:18:15,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:18:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:18:15,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:18:15,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:18:15,760 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:18:15,869 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:18:15,871 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:18:16,267 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:18:16,620 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:18:16,620 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 00:18:16,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:18:16 BoogieIcfgContainer [2023-11-29 00:18:16,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:18:16,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:18:16,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:18:16,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:18:16,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:18:15" (1/3) ... [2023-11-29 00:18:16,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d4557e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:18:16, skipping insertion in model container [2023-11-29 00:18:16,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:18:15" (2/3) ... [2023-11-29 00:18:16,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d4557e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:18:16, skipping insertion in model container [2023-11-29 00:18:16,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:18:16" (3/3) ... [2023-11-29 00:18:16,627 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2023-11-29 00:18:16,635 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:18:16,646 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:18:16,646 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:18:16,646 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:18:16,713 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 00:18:16,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 101 flow [2023-11-29 00:18:16,780 INFO L124 PetriNetUnfolderBase]: 5/37 cut-off events. [2023-11-29 00:18:16,780 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 00:18:16,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 5/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-11-29 00:18:16,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 40 transitions, 101 flow [2023-11-29 00:18:16,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 36 transitions, 90 flow [2023-11-29 00:18:16,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:18:16,800 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@19112ec5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:18:16,800 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 00:18:16,814 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:18:16,814 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2023-11-29 00:18:16,814 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 00:18:16,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:18:16,815 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] [2023-11-29 00:18:16,815 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 00:18:16,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:16,820 INFO L85 PathProgramCache]: Analyzing trace with hash 449003182, now seen corresponding path program 1 times [2023-11-29 00:18:16,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:16,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696242314] [2023-11-29 00:18:16,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:17,185 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:18:17,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:17,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696242314] [2023-11-29 00:18:17,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696242314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:18:17,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:18:17,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:18:17,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583565533] [2023-11-29 00:18:17,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:18:17,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:18:17,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:17,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:18:17,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:18:17,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2023-11-29 00:18:17,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:18:17,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:18:17,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2023-11-29 00:18:17,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:18:17,618 INFO L124 PetriNetUnfolderBase]: 1301/1975 cut-off events. [2023-11-29 00:18:17,619 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-11-29 00:18:17,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 1975 events. 1301/1975 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9372 event pairs, 335 based on Foata normal form. 1/1969 useless extension candidates. Maximal degree in co-relation 3367. Up to 1333 conditions per place. [2023-11-29 00:18:17,640 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 49 selfloop transitions, 4 changer transitions 1/58 dead transitions. [2023-11-29 00:18:17,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 257 flow [2023-11-29 00:18:17,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:18:17,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:18:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2023-11-29 00:18:17,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2023-11-29 00:18:17,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 76 transitions. [2023-11-29 00:18:17,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 76 transitions. [2023-11-29 00:18:17,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:18:17,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 76 transitions. [2023-11-29 00:18:17,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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:18:17,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 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:18:17,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 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:18:17,666 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 90 flow. Second operand 3 states and 76 transitions. [2023-11-29 00:18:17,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 58 transitions, 257 flow [2023-11-29 00:18:17,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 235 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 00:18:17,675 INFO L231 Difference]: Finished difference. Result has 38 places, 39 transitions, 104 flow [2023-11-29 00:18:17,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=39} [2023-11-29 00:18:17,681 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-11-29 00:18:17,681 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 39 transitions, 104 flow [2023-11-29 00:18:17,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:18:17,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:18:17,682 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] [2023-11-29 00:18:17,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:18:17,682 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 00:18:17,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:17,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1131771001, now seen corresponding path program 1 times [2023-11-29 00:18:17,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:17,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907307020] [2023-11-29 00:18:17,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:17,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:18:17,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:17,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907307020] [2023-11-29 00:18:17,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907307020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:18:17,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:18:17,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:18:17,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730748295] [2023-11-29 00:18:17,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:18:17,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:18:17,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:17,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:18:17,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:18:17,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2023-11-29 00:18:17,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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:18:17,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:18:17,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2023-11-29 00:18:17,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:18:18,223 INFO L124 PetriNetUnfolderBase]: 1024/1671 cut-off events. [2023-11-29 00:18:18,223 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-29 00:18:18,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3330 conditions, 1671 events. 1024/1671 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8653 event pairs, 743 based on Foata normal form. 1/1635 useless extension candidates. Maximal degree in co-relation 1520. Up to 1426 conditions per place. [2023-11-29 00:18:18,235 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 27 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2023-11-29 00:18:18,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 174 flow [2023-11-29 00:18:18,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:18:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:18:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2023-11-29 00:18:18,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2023-11-29 00:18:18,238 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 75 transitions. [2023-11-29 00:18:18,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 75 transitions. [2023-11-29 00:18:18,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:18:18,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 75 transitions. [2023-11-29 00:18:18,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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:18:18,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 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:18:18,241 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 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:18:18,241 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 104 flow. Second operand 4 states and 75 transitions. [2023-11-29 00:18:18,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 174 flow [2023-11-29 00:18:18,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:18:18,244 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 126 flow [2023-11-29 00:18:18,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2023-11-29 00:18:18,245 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-11-29 00:18:18,245 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 126 flow [2023-11-29 00:18:18,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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:18:18,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:18:18,246 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] [2023-11-29 00:18:18,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:18:18,246 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 00:18:18,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:18,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1903058163, now seen corresponding path program 1 times [2023-11-29 00:18:18,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:18,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508308701] [2023-11-29 00:18:18,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:18,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 00:18:18,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:18,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508308701] [2023-11-29 00:18:18,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508308701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:18:18,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:18:18,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:18:18,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738826597] [2023-11-29 00:18:18,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:18:18,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:18:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:18,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:18:18,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:18:18,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2023-11-29 00:18:18,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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:18:18,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:18:18,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2023-11-29 00:18:18,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:18:18,680 INFO L124 PetriNetUnfolderBase]: 1250/1933 cut-off events. [2023-11-29 00:18:18,680 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-11-29 00:18:18,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3906 conditions, 1933 events. 1250/1933 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9530 event pairs, 401 based on Foata normal form. 0/1844 useless extension candidates. Maximal degree in co-relation 3882. Up to 968 conditions per place. [2023-11-29 00:18:18,699 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 42 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2023-11-29 00:18:18,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 248 flow [2023-11-29 00:18:18,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:18:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:18:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2023-11-29 00:18:18,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50625 [2023-11-29 00:18:18,701 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 81 transitions. [2023-11-29 00:18:18,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 81 transitions. [2023-11-29 00:18:18,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:18:18,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 81 transitions. [2023-11-29 00:18:18,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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:18:18,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 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:18:18,703 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 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:18:18,703 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 126 flow. Second operand 4 states and 81 transitions. [2023-11-29 00:18:18,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 248 flow [2023-11-29 00:18:18,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 238 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-29 00:18:18,707 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 137 flow [2023-11-29 00:18:18,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2023-11-29 00:18:18,708 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-11-29 00:18:18,708 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 137 flow [2023-11-29 00:18:18,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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:18:18,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:18:18,708 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] [2023-11-29 00:18:18,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:18:18,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 00:18:18,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash -618918109, now seen corresponding path program 1 times [2023-11-29 00:18:18,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:18,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109416223] [2023-11-29 00:18:18,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:18,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:18:18,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:18,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109416223] [2023-11-29 00:18:18,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109416223] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:18:18,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441648900] [2023-11-29 00:18:18,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:18,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:18,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:18:18,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:18:18,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:18:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:19,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:18:19,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:18:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:18:19,107 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:18:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:18:19,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441648900] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 00:18:19,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:18:19,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-11-29 00:18:19,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79336098] [2023-11-29 00:18:19,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:18:19,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:18:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:18:19,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:18:19,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2023-11-29 00:18:19,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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:18:19,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:18:19,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2023-11-29 00:18:19,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:18:19,469 INFO L124 PetriNetUnfolderBase]: 1278/1970 cut-off events. [2023-11-29 00:18:19,469 INFO L125 PetriNetUnfolderBase]: For 660/660 co-relation queries the response was YES. [2023-11-29 00:18:19,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4510 conditions, 1970 events. 1278/1970 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9552 event pairs, 363 based on Foata normal form. 0/1852 useless extension candidates. Maximal degree in co-relation 4480. Up to 985 conditions per place. [2023-11-29 00:18:19,490 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 41 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-11-29 00:18:19,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 269 flow [2023-11-29 00:18:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:18:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:18:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2023-11-29 00:18:19,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455 [2023-11-29 00:18:19,492 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 91 transitions. [2023-11-29 00:18:19,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 91 transitions. [2023-11-29 00:18:19,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:18:19,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 91 transitions. [2023-11-29 00:18:19,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 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:18:19,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 0 states have call successors, (0), 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:18:19,494 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 0 states have call successors, (0), 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:18:19,494 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 137 flow. Second operand 5 states and 91 transitions. [2023-11-29 00:18:19,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 269 flow [2023-11-29 00:18:19,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:18:19,498 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 156 flow [2023-11-29 00:18:19,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2023-11-29 00:18:19,499 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-11-29 00:18:19,500 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 156 flow [2023-11-29 00:18:19,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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:18:19,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:18:19,500 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, 1] [2023-11-29 00:18:19,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:18:19,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:19,705 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 00:18:19,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:19,705 INFO L85 PathProgramCache]: Analyzing trace with hash 358728294, now seen corresponding path program 1 times [2023-11-29 00:18:19,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:19,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286033244] [2023-11-29 00:18:19,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:19,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:18:21,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286033244] [2023-11-29 00:18:21,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286033244] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:18:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881831383] [2023-11-29 00:18:21,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:21,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:21,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:18:21,328 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:18:21,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:18:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:21,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 00:18:21,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:18:21,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:18:22,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:22,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-11-29 00:18:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:18:22,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:18:22,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:22,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2023-11-29 00:18:22,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:22,727 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 1 case distinctions, treesize of input 198 treesize of output 174 [2023-11-29 00:18:22,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:22,747 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 1 case distinctions, treesize of input 154 treesize of output 130 [2023-11-29 00:18:22,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:22,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 369 treesize of output 313 [2023-11-29 00:18:22,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:22,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 192 [2023-11-29 00:18:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:18:23,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881831383] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:18:23,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:18:23,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 30 [2023-11-29 00:18:23,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786133071] [2023-11-29 00:18:23,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:18:23,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 00:18:23,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:23,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 00:18:23,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2023-11-29 00:18:23,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2023-11-29 00:18:23,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 156 flow. Second operand has 31 states, 31 states have (on average 8.225806451612904) internal successors, (255), 31 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-29 00:18:23,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:18:23,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2023-11-29 00:18:23,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:18:27,250 INFO L124 PetriNetUnfolderBase]: 5242/7773 cut-off events. [2023-11-29 00:18:27,251 INFO L125 PetriNetUnfolderBase]: For 3486/3486 co-relation queries the response was YES. [2023-11-29 00:18:27,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19918 conditions, 7773 events. 5242/7773 cut-off events. For 3486/3486 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 42582 event pairs, 289 based on Foata normal form. 2/7772 useless extension candidates. Maximal degree in co-relation 11378. Up to 2763 conditions per place. [2023-11-29 00:18:27,321 INFO L140 encePairwiseOnDemand]: 24/40 looper letters, 295 selfloop transitions, 112 changer transitions 2/413 dead transitions. [2023-11-29 00:18:27,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 413 transitions, 2084 flow [2023-11-29 00:18:27,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-29 00:18:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-11-29 00:18:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 607 transitions. [2023-11-29 00:18:27,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44632352941176473 [2023-11-29 00:18:27,326 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 607 transitions. [2023-11-29 00:18:27,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 607 transitions. [2023-11-29 00:18:27,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:18:27,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 607 transitions. [2023-11-29 00:18:27,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 17.852941176470587) internal successors, (607), 34 states have internal predecessors, (607), 0 states have call successors, (0), 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:18:27,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 40.0) internal successors, (1400), 35 states have internal predecessors, (1400), 0 states have call successors, (0), 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:18:27,334 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 40.0) internal successors, (1400), 35 states have internal predecessors, (1400), 0 states have call successors, (0), 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:18:27,334 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 156 flow. Second operand 34 states and 607 transitions. [2023-11-29 00:18:27,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 413 transitions, 2084 flow [2023-11-29 00:18:27,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 413 transitions, 2064 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 00:18:27,352 INFO L231 Difference]: Finished difference. Result has 102 places, 154 transitions, 1018 flow [2023-11-29 00:18:27,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1018, PETRI_PLACES=102, PETRI_TRANSITIONS=154} [2023-11-29 00:18:27,353 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2023-11-29 00:18:27,353 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 154 transitions, 1018 flow [2023-11-29 00:18:27,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.225806451612904) internal successors, (255), 31 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-29 00:18:27,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:18:27,354 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, 1] [2023-11-29 00:18:27,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:18:27,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:27,554 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 00:18:27,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:27,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1197051504, now seen corresponding path program 2 times [2023-11-29 00:18:27,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:27,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978949413] [2023-11-29 00:18:27,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:27,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:18:28,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:28,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978949413] [2023-11-29 00:18:28,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978949413] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:18:28,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211537010] [2023-11-29 00:18:28,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:18:28,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:28,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:18:28,701 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:18:28,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:18:28,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:18:28,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:18:28,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 00:18:28,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:18:29,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:18:29,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:29,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-11-29 00:18:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:18:29,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:18:29,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:29,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2023-11-29 00:18:29,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:29,808 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 1 case distinctions, treesize of input 214 treesize of output 190 [2023-11-29 00:18:29,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:29,826 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 1 case distinctions, treesize of input 166 treesize of output 130 [2023-11-29 00:18:29,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:29,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 104 [2023-11-29 00:18:29,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:29,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 68 [2023-11-29 00:18:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:18:30,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211537010] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:18:30,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:18:30,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 28 [2023-11-29 00:18:30,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580935533] [2023-11-29 00:18:30,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:18:30,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 00:18:30,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:30,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 00:18:30,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2023-11-29 00:18:30,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2023-11-29 00:18:30,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 154 transitions, 1018 flow. Second operand has 29 states, 29 states have (on average 8.310344827586206) internal successors, (241), 29 states have internal predecessors, (241), 0 states have call successors, (0), 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:18:30,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:18:30,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2023-11-29 00:18:30,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:18:33,759 INFO L124 PetriNetUnfolderBase]: 7884/11482 cut-off events. [2023-11-29 00:18:33,760 INFO L125 PetriNetUnfolderBase]: For 44660/44660 co-relation queries the response was YES. [2023-11-29 00:18:33,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44171 conditions, 11482 events. 7884/11482 cut-off events. For 44660/44660 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 65727 event pairs, 759 based on Foata normal form. 1/11479 useless extension candidates. Maximal degree in co-relation 38850. Up to 7029 conditions per place. [2023-11-29 00:18:33,851 INFO L140 encePairwiseOnDemand]: 23/40 looper letters, 335 selfloop transitions, 129 changer transitions 1/469 dead transitions. [2023-11-29 00:18:33,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 469 transitions, 3573 flow [2023-11-29 00:18:33,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-29 00:18:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-11-29 00:18:33,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 545 transitions. [2023-11-29 00:18:33,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4007352941176471 [2023-11-29 00:18:33,855 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 545 transitions. [2023-11-29 00:18:33,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 545 transitions. [2023-11-29 00:18:33,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:18:33,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 545 transitions. [2023-11-29 00:18:33,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 16.029411764705884) internal successors, (545), 34 states have internal predecessors, (545), 0 states have call successors, (0), 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:18:33,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 40.0) internal successors, (1400), 35 states have internal predecessors, (1400), 0 states have call successors, (0), 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:18:33,862 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 40.0) internal successors, (1400), 35 states have internal predecessors, (1400), 0 states have call successors, (0), 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:18:33,862 INFO L175 Difference]: Start difference. First operand has 102 places, 154 transitions, 1018 flow. Second operand 34 states and 545 transitions. [2023-11-29 00:18:33,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 469 transitions, 3573 flow [2023-11-29 00:18:34,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 469 transitions, 3373 flow, removed 96 selfloop flow, removed 2 redundant places. [2023-11-29 00:18:34,033 INFO L231 Difference]: Finished difference. Result has 151 places, 258 transitions, 2279 flow [2023-11-29 00:18:34,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2279, PETRI_PLACES=151, PETRI_TRANSITIONS=258} [2023-11-29 00:18:34,034 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 110 predicate places. [2023-11-29 00:18:34,034 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 258 transitions, 2279 flow [2023-11-29 00:18:34,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.310344827586206) internal successors, (241), 29 states have internal predecessors, (241), 0 states have call successors, (0), 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:18:34,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:18:34,035 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, 1] [2023-11-29 00:18:34,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:18:34,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:34,236 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 00:18:34,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:18:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1669322798, now seen corresponding path program 3 times [2023-11-29 00:18:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:18:34,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259779374] [2023-11-29 00:18:34,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:18:34,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:18:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:18:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:18:35,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:18:35,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259779374] [2023-11-29 00:18:35,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259779374] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:18:35,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189483894] [2023-11-29 00:18:35,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:18:35,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:18:35,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:18:35,762 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:18:35,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:18:35,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 00:18:35,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:18:35,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 00:18:35,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:18:36,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:18:36,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:36,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 81 [2023-11-29 00:18:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:18:36,744 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:18:45,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:45,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 240 [2023-11-29 00:18:45,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:45,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 401 treesize of output 337 [2023-11-29 00:18:45,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:18:45,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 208 [2023-11-29 00:18:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:18:45,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189483894] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:18:45,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:18:45,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2023-11-29 00:18:45,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111907982] [2023-11-29 00:18:45,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:18:45,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-29 00:18:45,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:18:45,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-29 00:18:45,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1359, Unknown=2, NotChecked=0, Total=1560 [2023-11-29 00:18:50,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:18:54,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:18:54,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2023-11-29 00:18:54,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 258 transitions, 2279 flow. Second operand has 40 states, 40 states have (on average 6.125) internal successors, (245), 40 states have internal predecessors, (245), 0 states have call successors, (0), 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:18:54,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:18:54,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2023-11-29 00:18:54,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:19:19,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:19:24,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:19:28,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:19:32,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:19:36,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:19:41,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:20:09,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:20:14,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:20:51,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:20:55,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:21:31,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:21:35,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:21:39,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:21:44,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:21:48,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:21:52,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:21:57,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:22:01,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:22:05,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 00:22:08,770 INFO L124 PetriNetUnfolderBase]: 22738/31889 cut-off events. [2023-11-29 00:22:08,770 INFO L125 PetriNetUnfolderBase]: For 224389/224389 co-relation queries the response was YES. [2023-11-29 00:22:09,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146467 conditions, 31889 events. 22738/31889 cut-off events. For 224389/224389 co-relation queries the response was YES. Maximal size of possible extension queue 1054. Compared 185292 event pairs, 1188 based on Foata normal form. 2/30225 useless extension candidates. Maximal degree in co-relation 132466. Up to 12136 conditions per place. [2023-11-29 00:22:09,198 INFO L140 encePairwiseOnDemand]: 22/40 looper letters, 782 selfloop transitions, 469 changer transitions 6/1258 dead transitions. [2023-11-29 00:22:09,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 1258 transitions, 11107 flow [2023-11-29 00:22:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2023-11-29 00:22:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2023-11-29 00:22:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 1230 transitions. [2023-11-29 00:22:09,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38924050632911394 [2023-11-29 00:22:09,207 INFO L72 ComplementDD]: Start complementDD. Operand 79 states and 1230 transitions. [2023-11-29 00:22:09,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 1230 transitions. [2023-11-29 00:22:09,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:22:09,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 79 states and 1230 transitions. [2023-11-29 00:22:09,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 80 states, 79 states have (on average 15.569620253164556) internal successors, (1230), 79 states have internal predecessors, (1230), 0 states have call successors, (0), 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:22:09,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 80 states, 80 states have (on average 40.0) internal successors, (3200), 80 states have internal predecessors, (3200), 0 states have call successors, (0), 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:22:09,223 INFO L81 ComplementDD]: Finished complementDD. Result has 80 states, 80 states have (on average 40.0) internal successors, (3200), 80 states have internal predecessors, (3200), 0 states have call successors, (0), 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:22:09,223 INFO L175 Difference]: Start difference. First operand has 151 places, 258 transitions, 2279 flow. Second operand 79 states and 1230 transitions. [2023-11-29 00:22:09,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 1258 transitions, 11107 flow [2023-11-29 00:22:10,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 1258 transitions, 10299 flow, removed 393 selfloop flow, removed 7 redundant places. [2023-11-29 00:22:10,634 INFO L231 Difference]: Finished difference. Result has 255 places, 627 transitions, 7239 flow [2023-11-29 00:22:10,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1912, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=79, PETRI_FLOW=7239, PETRI_PLACES=255, PETRI_TRANSITIONS=627} [2023-11-29 00:22:10,635 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 214 predicate places. [2023-11-29 00:22:10,635 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 627 transitions, 7239 flow [2023-11-29 00:22:10,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.125) internal successors, (245), 40 states have internal predecessors, (245), 0 states have call successors, (0), 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:22:10,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:22:10,635 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, 1] [2023-11-29 00:22:10,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 00:22:10,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:22:10,836 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 00:22:10,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:22:10,836 INFO L85 PathProgramCache]: Analyzing trace with hash 653263796, now seen corresponding path program 4 times [2023-11-29 00:22:10,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:22:10,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443873540] [2023-11-29 00:22:10,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:22:10,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:22:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:22:12,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:22:12,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443873540] [2023-11-29 00:22:12,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443873540] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:22:12,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657981650] [2023-11-29 00:22:12,177 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:22:12,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:22:12,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:22:12,189 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:22:12,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:22:12,321 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:22:12,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:22:12,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-29 00:22:12,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:22:12,336 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-29 00:22:12,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,343 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-29 00:22:12,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,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 11 treesize of output 1 [2023-11-29 00:22:12,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,351 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-29 00:22:12,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,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-29 00:22:12,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,361 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-29 00:22:12,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,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 11 treesize of output 1 [2023-11-29 00:22:12,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,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 6 treesize of output 1 [2023-11-29 00:22:12,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,379 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-29 00:22:12,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,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 6 treesize of output 1 [2023-11-29 00:22:12,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,389 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-29 00:22:12,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,397 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-29 00:22:12,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,407 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-29 00:22:12,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,414 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-29 00:22:12,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,424 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-29 00:22:12,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,435 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-29 00:22:12,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,444 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-29 00:22:12,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,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 11 treesize of output 1 [2023-11-29 00:22:12,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,457 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-29 00:22:12,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,461 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-29 00:22:12,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,467 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-29 00:22:12,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,472 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-29 00:22:12,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,480 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-29 00:22:12,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:12,486 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-29 00:22:12,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:22:12,551 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:22:12,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 00:22:12,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:22:12,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 00:22:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:22:13,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:22:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:22:13,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657981650] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:22:13,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:22:13,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 35 [2023-11-29 00:22:13,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071616703] [2023-11-29 00:22:13,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:22:13,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-29 00:22:13,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:22:13,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 00:22:13,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1125, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 00:22:13,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2023-11-29 00:22:13,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 627 transitions, 7239 flow. Second operand has 36 states, 36 states have (on average 7.027777777777778) internal successors, (253), 36 states have internal predecessors, (253), 0 states have call successors, (0), 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:22:13,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:22:13,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2023-11-29 00:22:13,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:22:27,510 INFO L124 PetriNetUnfolderBase]: 29154/41918 cut-off events. [2023-11-29 00:22:27,510 INFO L125 PetriNetUnfolderBase]: For 823439/823439 co-relation queries the response was YES. [2023-11-29 00:22:28,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261195 conditions, 41918 events. 29154/41918 cut-off events. For 823439/823439 co-relation queries the response was YES. Maximal size of possible extension queue 1623. Compared 276558 event pairs, 1481 based on Foata normal form. 4/40194 useless extension candidates. Maximal degree in co-relation 258456. Up to 22920 conditions per place. [2023-11-29 00:22:28,260 INFO L140 encePairwiseOnDemand]: 21/40 looper letters, 1100 selfloop transitions, 940 changer transitions 4/2047 dead transitions. [2023-11-29 00:22:28,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 2047 transitions, 28113 flow [2023-11-29 00:22:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-29 00:22:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2023-11-29 00:22:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 999 transitions. [2023-11-29 00:22:28,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390234375 [2023-11-29 00:22:28,264 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 999 transitions. [2023-11-29 00:22:28,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 999 transitions. [2023-11-29 00:22:28,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:22:28,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 999 transitions. [2023-11-29 00:22:28,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 15.609375) internal successors, (999), 64 states have internal predecessors, (999), 0 states have call successors, (0), 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:22:28,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 40.0) internal successors, (2600), 65 states have internal predecessors, (2600), 0 states have call successors, (0), 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:22:28,270 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 40.0) internal successors, (2600), 65 states have internal predecessors, (2600), 0 states have call successors, (0), 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:22:28,271 INFO L175 Difference]: Start difference. First operand has 255 places, 627 transitions, 7239 flow. Second operand 64 states and 999 transitions. [2023-11-29 00:22:28,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 2047 transitions, 28113 flow [2023-11-29 00:22:41,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 2047 transitions, 23734 flow, removed 2075 selfloop flow, removed 12 redundant places. [2023-11-29 00:22:41,440 INFO L231 Difference]: Finished difference. Result has 329 places, 1383 transitions, 17378 flow [2023-11-29 00:22:41,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5683, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=17378, PETRI_PLACES=329, PETRI_TRANSITIONS=1383} [2023-11-29 00:22:41,441 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 288 predicate places. [2023-11-29 00:22:41,441 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 1383 transitions, 17378 flow [2023-11-29 00:22:41,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.027777777777778) internal successors, (253), 36 states have internal predecessors, (253), 0 states have call successors, (0), 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:22:41,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:22:41,442 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, 1] [2023-11-29 00:22:41,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 00:22:41,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:22:41,643 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 00:22:41,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:22:41,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1257463206, now seen corresponding path program 5 times [2023-11-29 00:22:41,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:22:41,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771057760] [2023-11-29 00:22:41,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:22:41,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:22:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:22:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:22:42,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:22:42,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771057760] [2023-11-29 00:22:42,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771057760] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:22:42,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332982245] [2023-11-29 00:22:42,890 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:22:42,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:22:42,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:22:42,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:22:42,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:22:42,993 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-29 00:22:42,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:22:42,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 00:22:42,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:22:43,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:22:43,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:22:43,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-11-29 00:22:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:22:43,517 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:22:43,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:22:43,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2023-11-29 00:22:44,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:44,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 50 [2023-11-29 00:22:44,300 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:22:44,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:22:44,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 83 [2023-11-29 00:22:44,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:44,394 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-29 00:22:44,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 1 [2023-11-29 00:22:44,490 INFO L349 Elim1Store]: treesize reduction 13, result has 77.2 percent of original size [2023-11-29 00:22:44,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 221 [2023-11-29 00:22:45,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:22:45,087 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 1 case distinctions, treesize of input 214 treesize of output 190 [2023-11-29 00:22:45,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:22:45,103 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 1 case distinctions, treesize of input 166 treesize of output 130 [2023-11-29 00:22:45,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2023-11-29 00:22:45,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 50 [2023-11-29 00:22:45,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,292 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 00:22:45,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 283 treesize of output 1 [2023-11-29 00:22:45,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,310 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 00:22:45,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 1 [2023-11-29 00:22:45,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 227 [2023-11-29 00:22:45,335 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 00:22:45,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 162 [2023-11-29 00:22:45,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,361 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 110 [2023-11-29 00:22:45,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,420 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 94 [2023-11-29 00:22:45,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,429 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 50 [2023-11-29 00:22:45,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,474 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 300 treesize of output 246 [2023-11-29 00:22:45,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,488 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 170 [2023-11-29 00:22:45,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 178 [2023-11-29 00:22:45,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 110 [2023-11-29 00:22:45,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:22:45,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 369 treesize of output 295 [2023-11-29 00:22:45,733 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-29 00:22:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:22:45,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332982245] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:22:45,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:22:45,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 35 [2023-11-29 00:22:45,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260628136] [2023-11-29 00:22:45,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:22:45,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-29 00:22:45,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:22:45,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 00:22:45,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 00:22:46,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2023-11-29 00:22:46,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 1383 transitions, 17378 flow. Second operand has 36 states, 36 states have (on average 8.0) internal successors, (288), 36 states have internal predecessors, (288), 0 states have call successors, (0), 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:22:46,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:22:46,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2023-11-29 00:22:46,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:23:03,324 INFO L124 PetriNetUnfolderBase]: 30606/44407 cut-off events. [2023-11-29 00:23:03,324 INFO L125 PetriNetUnfolderBase]: For 1111470/1111621 co-relation queries the response was YES. [2023-11-29 00:23:04,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306382 conditions, 44407 events. 30606/44407 cut-off events. For 1111470/1111621 co-relation queries the response was YES. Maximal size of possible extension queue 1878. Compared 302116 event pairs, 2968 based on Foata normal form. 21/44289 useless extension candidates. Maximal degree in co-relation 302965. Up to 30355 conditions per place. [2023-11-29 00:23:04,414 INFO L140 encePairwiseOnDemand]: 23/40 looper letters, 990 selfloop transitions, 997 changer transitions 1/2021 dead transitions. [2023-11-29 00:23:04,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 2021 transitions, 29502 flow [2023-11-29 00:23:04,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-29 00:23:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-29 00:23:04,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 670 transitions. [2023-11-29 00:23:04,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2023-11-29 00:23:04,417 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 670 transitions. [2023-11-29 00:23:04,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 670 transitions. [2023-11-29 00:23:04,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:23:04,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 670 transitions. [2023-11-29 00:23:04,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 15.952380952380953) internal successors, (670), 42 states have internal predecessors, (670), 0 states have call successors, (0), 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:23:04,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 40.0) internal successors, (1720), 43 states have internal predecessors, (1720), 0 states have call successors, (0), 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:23:04,421 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 40.0) internal successors, (1720), 43 states have internal predecessors, (1720), 0 states have call successors, (0), 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:23:04,421 INFO L175 Difference]: Start difference. First operand has 329 places, 1383 transitions, 17378 flow. Second operand 42 states and 670 transitions. [2023-11-29 00:23:04,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 2021 transitions, 29502 flow [2023-11-29 00:23:26,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 2021 transitions, 26121 flow, removed 1676 selfloop flow, removed 5 redundant places. [2023-11-29 00:23:26,583 INFO L231 Difference]: Finished difference. Result has 375 places, 1763 transitions, 23824 flow [2023-11-29 00:23:26,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=14791, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=694, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=23824, PETRI_PLACES=375, PETRI_TRANSITIONS=1763} [2023-11-29 00:23:26,586 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 334 predicate places. [2023-11-29 00:23:26,586 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 1763 transitions, 23824 flow [2023-11-29 00:23:26,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 8.0) internal successors, (288), 36 states have internal predecessors, (288), 0 states have call successors, (0), 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:23:26,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:23:26,586 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, 1] [2023-11-29 00:23:26,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 00:23:26,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:23:26,787 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 00:23:26,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:23:26,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1841253210, now seen corresponding path program 6 times [2023-11-29 00:23:26,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:23:26,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481890720] [2023-11-29 00:23:26,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:23:26,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:23:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:23:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:23:28,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:23:28,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481890720] [2023-11-29 00:23:28,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481890720] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:23:28,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306450058] [2023-11-29 00:23:28,120 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 00:23:28,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:23:28,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:23:28,121 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:23:28,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:23:28,279 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-29 00:23:28,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:23:28,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 00:23:28,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:23:28,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:23:28,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:23:28,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-11-29 00:23:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:23:28,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:23:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:23:28,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306450058] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:23:28,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:23:28,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 10] total 32 [2023-11-29 00:23:28,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454795110] [2023-11-29 00:23:28,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:23:28,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 00:23:28,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:23:28,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 00:23:28,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 00:23:29,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2023-11-29 00:23:29,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 1763 transitions, 23824 flow. Second operand has 33 states, 33 states have (on average 7.181818181818182) internal successors, (237), 33 states have internal predecessors, (237), 0 states have call successors, (0), 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:23:29,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:23:29,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2023-11-29 00:23:29,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:23:56,157 INFO L124 PetriNetUnfolderBase]: 42374/60663 cut-off events. [2023-11-29 00:23:56,157 INFO L125 PetriNetUnfolderBase]: For 1704984/1704984 co-relation queries the response was YES. [2023-11-29 00:23:57,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446672 conditions, 60663 events. 42374/60663 cut-off events. For 1704984/1704984 co-relation queries the response was YES. Maximal size of possible extension queue 2486. Compared 416201 event pairs, 2739 based on Foata normal form. 2/60665 useless extension candidates. Maximal degree in co-relation 443601. Up to 36350 conditions per place. [2023-11-29 00:23:57,871 INFO L140 encePairwiseOnDemand]: 19/40 looper letters, 1825 selfloop transitions, 1370 changer transitions 2/3200 dead transitions. [2023-11-29 00:23:57,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 3200 transitions, 50393 flow [2023-11-29 00:23:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-11-29 00:23:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-11-29 00:23:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 1223 transitions. [2023-11-29 00:23:57,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3514367816091954 [2023-11-29 00:23:57,875 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 1223 transitions. [2023-11-29 00:23:57,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 1223 transitions. [2023-11-29 00:23:57,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:23:57,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 1223 transitions. [2023-11-29 00:23:57,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 14.057471264367816) internal successors, (1223), 87 states have internal predecessors, (1223), 0 states have call successors, (0), 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:23:57,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 40.0) internal successors, (3520), 88 states have internal predecessors, (3520), 0 states have call successors, (0), 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:23:57,882 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 40.0) internal successors, (3520), 88 states have internal predecessors, (3520), 0 states have call successors, (0), 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:23:57,883 INFO L175 Difference]: Start difference. First operand has 375 places, 1763 transitions, 23824 flow. Second operand 87 states and 1223 transitions. [2023-11-29 00:23:57,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 3200 transitions, 50393 flow [2023-11-29 00:25:13,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 3200 transitions, 45991 flow, removed 1985 selfloop flow, removed 22 redundant places. [2023-11-29 00:25:13,859 INFO L231 Difference]: Finished difference. Result has 478 places, 2578 transitions, 39349 flow [2023-11-29 00:25:13,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=21309, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=677, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=39349, PETRI_PLACES=478, PETRI_TRANSITIONS=2578} [2023-11-29 00:25:13,861 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 437 predicate places. [2023-11-29 00:25:13,862 INFO L495 AbstractCegarLoop]: Abstraction has has 478 places, 2578 transitions, 39349 flow [2023-11-29 00:25:13,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.181818181818182) internal successors, (237), 33 states have internal predecessors, (237), 0 states have call successors, (0), 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:25:13,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:25:13,862 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, 1] [2023-11-29 00:25:13,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 00:25:14,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 00:25:14,063 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 00:25:14,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:25:14,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1816714618, now seen corresponding path program 7 times [2023-11-29 00:25:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:25:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445956404] [2023-11-29 00:25:14,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:25:14,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:25:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:25:15,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:25:15,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445956404] [2023-11-29 00:25:15,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445956404] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:25:15,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886495438] [2023-11-29 00:25:15,028 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 00:25:15,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:25:15,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:25:15,029 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:25:15,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 00:25:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:15,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 00:25:15,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:25:15,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:25:15,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:25:15,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-11-29 00:25:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:25:15,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:25:15,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:25:15,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 240 [2023-11-29 00:25:16,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:25:16,084 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 1 case distinctions, treesize of input 300 treesize of output 260 [2023-11-29 00:25:16,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:25:16,096 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 1 case distinctions, treesize of input 252 treesize of output 196 [2023-11-29 00:25:16,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:25:16,269 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 178 [2023-11-29 00:25:16,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:25:16,275 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 110 [2023-11-29 00:25:16,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:25:16,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 227 [2023-11-29 00:25:16,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:25:16,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 130 [2023-11-29 00:25:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:25:16,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886495438] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:25:16,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:25:16,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 34 [2023-11-29 00:25:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116767758] [2023-11-29 00:25:16,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:25:16,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 00:25:16,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:25:16,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 00:25:16,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 00:25:16,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2023-11-29 00:25:16,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 2578 transitions, 39349 flow. Second operand has 35 states, 35 states have (on average 8.114285714285714) internal successors, (284), 35 states have internal predecessors, (284), 0 states have call successors, (0), 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:25:16,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:25:16,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2023-11-29 00:25:16,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:25:51,799 INFO L124 PetriNetUnfolderBase]: 44837/64602 cut-off events. [2023-11-29 00:25:51,799 INFO L125 PetriNetUnfolderBase]: For 1324878/1325357 co-relation queries the response was YES. [2023-11-29 00:25:53,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482511 conditions, 64602 events. 44837/64602 cut-off events. For 1324878/1325357 co-relation queries the response was YES. Maximal size of possible extension queue 2808. Compared 455195 event pairs, 5408 based on Foata normal form. 82/64459 useless extension candidates. Maximal degree in co-relation 480756. Up to 54451 conditions per place. [2023-11-29 00:25:54,083 INFO L140 encePairwiseOnDemand]: 23/40 looper letters, 2566 selfloop transitions, 459 changer transitions 2/3091 dead transitions. [2023-11-29 00:25:54,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 3091 transitions, 52584 flow [2023-11-29 00:25:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-29 00:25:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-11-29 00:25:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 583 transitions. [2023-11-29 00:25:54,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4164285714285714 [2023-11-29 00:25:54,086 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 583 transitions. [2023-11-29 00:25:54,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 583 transitions. [2023-11-29 00:25:54,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:25:54,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 583 transitions. [2023-11-29 00:25:54,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 16.65714285714286) internal successors, (583), 35 states have internal predecessors, (583), 0 states have call successors, (0), 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:25:54,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 40.0) internal successors, (1440), 36 states have internal predecessors, (1440), 0 states have call successors, (0), 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:25:54,092 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 40.0) internal successors, (1440), 36 states have internal predecessors, (1440), 0 states have call successors, (0), 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:25:54,092 INFO L175 Difference]: Start difference. First operand has 478 places, 2578 transitions, 39349 flow. Second operand 35 states and 583 transitions. [2023-11-29 00:25:54,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 3091 transitions, 52584 flow [2023-11-29 00:26:55,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 3091 transitions, 45305 flow, removed 3535 selfloop flow, removed 11 redundant places. [2023-11-29 00:26:55,534 INFO L231 Difference]: Finished difference. Result has 521 places, 2843 transitions, 38397 flow [2023-11-29 00:26:55,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=32114, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=38397, PETRI_PLACES=521, PETRI_TRANSITIONS=2843} [2023-11-29 00:26:55,536 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 480 predicate places. [2023-11-29 00:26:55,536 INFO L495 AbstractCegarLoop]: Abstraction has has 521 places, 2843 transitions, 38397 flow [2023-11-29 00:26:55,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.114285714285714) internal successors, (284), 35 states have internal predecessors, (284), 0 states have call successors, (0), 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:26:55,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:26:55,537 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, 1] [2023-11-29 00:26:55,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 00:26:55,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 00:26:55,737 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 00:26:55,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:55,738 INFO L85 PathProgramCache]: Analyzing trace with hash -315586000, now seen corresponding path program 8 times [2023-11-29 00:26:55,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:55,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961274871] [2023-11-29 00:26:55,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:55,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:26:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:56,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961274871] [2023-11-29 00:26:56,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961274871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:26:56,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141072470] [2023-11-29 00:26:56,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:26:56,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:56,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:26:56,604 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:26:56,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 00:26:56,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:26:56,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:26:56,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 00:26:56,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:56,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:26:57,111 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-11-29 00:26:57,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 43 [2023-11-29 00:26:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:26:57,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:26:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:26:57,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141072470] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:26:57,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:26:57,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 33 [2023-11-29 00:26:57,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47374260] [2023-11-29 00:26:57,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:26:57,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 00:26:57,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:57,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 00:26:57,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 00:26:57,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2023-11-29 00:26:57,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 2843 transitions, 38397 flow. Second operand has 34 states, 34 states have (on average 7.382352941176471) internal successors, (251), 34 states have internal predecessors, (251), 0 states have call successors, (0), 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:26:57,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:26:57,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2023-11-29 00:26:57,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:27:57,130 INFO L124 PetriNetUnfolderBase]: 74430/104403 cut-off events. [2023-11-29 00:27:57,131 INFO L125 PetriNetUnfolderBase]: For 1939862/1940808 co-relation queries the response was YES. [2023-11-29 00:28:00,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736646 conditions, 104403 events. 74430/104403 cut-off events. For 1939862/1940808 co-relation queries the response was YES. Maximal size of possible extension queue 4244. Compared 727613 event pairs, 6090 based on Foata normal form. 329/104406 useless extension candidates. Maximal degree in co-relation 735729. Up to 62952 conditions per place. [2023-11-29 00:28:01,327 INFO L140 encePairwiseOnDemand]: 23/40 looper letters, 2948 selfloop transitions, 2158 changer transitions 2/5170 dead transitions. [2023-11-29 00:28:01,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 5170 transitions, 83957 flow [2023-11-29 00:28:01,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-29 00:28:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-11-29 00:28:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 716 transitions. [2023-11-29 00:28:01,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38085106382978723 [2023-11-29 00:28:01,330 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 716 transitions. [2023-11-29 00:28:01,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 716 transitions. [2023-11-29 00:28:01,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:28:01,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 716 transitions. [2023-11-29 00:28:01,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 15.23404255319149) internal successors, (716), 47 states have internal predecessors, (716), 0 states have call successors, (0), 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:28:01,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 40.0) internal successors, (1920), 48 states have internal predecessors, (1920), 0 states have call successors, (0), 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:28:01,337 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 40.0) internal successors, (1920), 48 states have internal predecessors, (1920), 0 states have call successors, (0), 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:28:01,337 INFO L175 Difference]: Start difference. First operand has 521 places, 2843 transitions, 38397 flow. Second operand 47 states and 716 transitions. [2023-11-29 00:28:01,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 5170 transitions, 83957 flow [2023-11-29 00:29:21,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 5170 transitions, 81824 flow, removed 1047 selfloop flow, removed 8 redundant places. [2023-11-29 00:29:21,329 INFO L231 Difference]: Finished difference. Result has 573 places, 4456 transitions, 74507 flow [2023-11-29 00:29:21,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=37292, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2843, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=709, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=74507, PETRI_PLACES=573, PETRI_TRANSITIONS=4456} [2023-11-29 00:29:21,332 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 532 predicate places. [2023-11-29 00:29:21,332 INFO L495 AbstractCegarLoop]: Abstraction has has 573 places, 4456 transitions, 74507 flow [2023-11-29 00:29:21,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.382352941176471) internal successors, (251), 34 states have internal predecessors, (251), 0 states have call successors, (0), 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:29:21,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:29:21,332 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, 1] [2023-11-29 00:29:21,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 00:29:21,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:29:21,533 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 00:29:21,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:21,533 INFO L85 PathProgramCache]: Analyzing trace with hash -536094644, now seen corresponding path program 9 times [2023-11-29 00:29:21,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:21,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421992188] [2023-11-29 00:29:21,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:21,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:22,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:22,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421992188] [2023-11-29 00:29:22,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421992188] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:29:22,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312811028] [2023-11-29 00:29:22,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:29:22,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:29:22,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:29:22,432 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:29:22,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_533292a0-b51c-4d17-8804-d0092f906700/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 00:29:22,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 00:29:22,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:29:22,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 00:29:22,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:29:22,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:29:23,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:29:23,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-11-29 00:29:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:23,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:29:23,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:29:23,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2023-11-29 00:29:23,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:29:23,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 120 [2023-11-29 00:29:24,042 INFO L349 Elim1Store]: treesize reduction 13, result has 77.2 percent of original size [2023-11-29 00:29:24,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 169 [2023-11-29 00:29:24,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:29:24,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:29:24,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 118 [2023-11-29 00:29:24,500 INFO L349 Elim1Store]: treesize reduction 13, result has 77.2 percent of original size [2023-11-29 00:29:24,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 107 [2023-11-29 00:29:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:24,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312811028] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:29:24,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:29:24,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 31 [2023-11-29 00:29:24,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580875750] [2023-11-29 00:29:24,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:29:24,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 00:29:24,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:24,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 00:29:24,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2023-11-29 00:29:24,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2023-11-29 00:29:24,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 4456 transitions, 74507 flow. Second operand has 32 states, 32 states have (on average 8.28125) internal successors, (265), 32 states have internal predecessors, (265), 0 states have call successors, (0), 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:29:24,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:29:24,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2023-11-29 00:29:24,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:29:49,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L49-->L51: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork1_~i~0#1_7| 4)) (.cse4 (+ |v_thread1Thread1of1ForFork1_plus_#res#1_1| 2147483648))) (let ((.cse3 (<= |v_thread1Thread1of1ForFork1_plus_#res#1_1| (+ 2147483647 v_~res1~0_43))) (.cse0 (<= v_~res1~0_43 .cse4)) (.cse2 (select (select |v_#memory_int#2_79| v_~B~0.base_88) (+ .cse1 v_~B~0.offset_88)))) (and .cse0 (= |v_thread1Thread1of1ForFork1_plus_#res#1_1| (+ (select (select |v_#memory_int#2_79| v_~A~0.base_110) (+ .cse1 v_~A~0.offset_110)) .cse2 v_~res1~0_43)) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_#res#1_1| v_~res1~0_43)) 1 0) 0)) (not (= (ite (or .cse3 (<= .cse2 0)) 1 0) 0)) (<= 0 (+ |v_thread1Thread1of1ForFork1_~tmp~0#1_3| 2147483648)) (= |v_thread1Thread1of1ForFork1_plus_#res#1_1| |v_thread1Thread1of1ForFork1_~tmp~0#1_3|) (<= |v_thread1Thread1of1ForFork1_~tmp~0#1_3| 2147483647) .cse3 (not (= (ite (or (<= 0 .cse4) (<= v_~res1~0_43 |v_thread1Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or .cse0 (<= 0 .cse2)) 1 0) 0))))) InVars {~res1~0=v_~res1~0_43, ~A~0.base=v_~A~0.base_110, ~B~0.base=v_~B~0.base_88, ~A~0.offset=v_~A~0.offset_110, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, #memory_int#2=|v_#memory_int#2_79|, ~B~0.offset=v_~B~0.offset_88} OutVars{~res1~0=v_~res1~0_43, thread1Thread1of1ForFork1_~tmp~0#1=|v_thread1Thread1of1ForFork1_~tmp~0#1_3|, ~A~0.base=v_~A~0.base_110, ~B~0.base=v_~B~0.base_88, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_1|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_1|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_1|, #memory_int#2=|v_#memory_int#2_79|, ~A~0.offset=v_~A~0.offset_110, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_1|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_1|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_1|, ~B~0.offset=v_~B~0.offset_88, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~tmp~0#1, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1][223], [Black: 1514#(and (= ~res2~0 ~res1~0) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))), Black: 1229#(and (= ~res2~0 ~res1~0) (= ~N~0 1)), Black: 1452#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 1476#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 1478#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 1250#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0)), Black: 1456#(and (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 406#(= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))), Black: 504#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (<= ~N~0 1) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 1287#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 1470#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 251#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1266#(and (<= 0 ~M~0) (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0)), Black: 262#(= ~res2~0 ~res1~0), Black: 492#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 1273#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~M~0 0)), Black: 1492#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 494#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 490#(and (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (= (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 1230#(= ~res2~0 ~res1~0), Black: 484#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 510#(and (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (= ~res1~0 (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 1454#(and (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~M~0 0)), Black: 498#(and (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (= ~res1~0 (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)))) (= (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 1516#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))), Black: 508#(and (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (= ~res1~0 (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))))), Black: 1490#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (or (= ~res1~0 0) (< |thread2Thread1of1ForFork2_~i~1#1| 0)) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 496#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 1448#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~M~0 0)), Black: 514#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (<= ~N~0 1)), Black: 1460#(and (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 2790#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 516#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 2834#(and (or (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0))), Black: 1280#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 1450#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 2796#(and (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (or (= ~N~0 1) (< 1 ~N~0)) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 474#(and (= ~res2~0 ~res1~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~N~0 2))), Black: 1462#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 2786#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (<= ~N~0 1) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 488#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 500#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 2820#(and (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (or (= ~N~0 1) (< 1 ~N~0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1466#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 506#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (<= ~N~0 1)), Black: 2784#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2808#(and (or (and (= ~N~0 1) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|)) (< 1 ~N~0)) (or (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (< 1 ~N~0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 480#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (<= ~N~0 1)), Black: 2812#(and (or (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), Black: 502#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (<= ~N~0 1) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 2549#true, Black: 2610#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 476#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (<= ~N~0 1)), Black: 261#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|), Black: 2563#(= ~res2~0 ~res1~0), Black: 2624#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 2822#(and (or (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)) (or (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 248#true, Black: 789#(and (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 553#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 777#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 765#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0) (= ~M~0 0)), Black: 557#(= ~res2~0 ~res1~0), Black: 779#(and (= ~res2~0 ~res1~0) (forall ((v_subst_3 Int)) (= (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) (select (select |#memory_int#2| v_subst_3) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) (+ ~res1~0 (select (select |#memory_int#2| v_subst_3) ~A~0.offset) (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)))) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) |thread3Thread1of1ForFork0_~tmp~2#1|) (<= ~N~0 1) (forall ((v_subst_4 Int)) (= (+ ~res2~0 (select (select |#memory_int#2| v_subst_4) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))) (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset) (select (select |#memory_int#2| v_subst_4) ~A~0.offset))))), Black: 769#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (<= ~N~0 1)), Black: 803#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 781#(and (= ~res2~0 ~res1~0) (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))) |thread3Thread1of1ForFork0_~tmp~2#1|) (forall ((v_subst_6 Int)) (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset) (select (select |#memory_int#2| v_subst_6) ~A~0.offset)) (+ (select (select |#memory_int#2| v_subst_6) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))))) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) |thread3Thread1of1ForFork0_~tmp~2#1|) (forall ((v_subst_5 Int)) (= (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| v_subst_5) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#2| v_subst_5) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)))) (<= ~N~0 1)), Black: 775#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0) (= ~M~0 0)), Black: 556#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|), Black: 787#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 1404#(or (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))), Black: 613#(and (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 801#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)), 4#L100-4true, Black: 799#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 552#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0)), Black: 1826#(and (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 1561#true, Black: 1836#(and (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 785#(and (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))) |thread3Thread1of1ForFork0_~tmp~2#1|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 1643#(= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|), Black: 797#(and (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 1575#(and (= ~res2~0 ~res1~0) (= ~N~0 1)), Black: 1830#(and (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_33| Int)) (or (= (+ (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_33| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_33| 4))) ~res2~0) |thread1Thread1of1ForFork1_~tmp~0#1|) (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_33|) (< |v_thread3Thread1of1ForFork0_~i~2#1_33| ~M~0))) (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))) |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1647#(= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|), Black: 1572#(and (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1838#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 1834#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1573#(and (= ~N~0 1) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 55#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 543#true, Black: 64#(<= (+ ~M~0 1) ~N~0), 2044#(or (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))))), 962#(or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (= ~res2~0 ~res1~0)), 2692#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)), 37#L75true, 13#L62true, Black: 1134#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|))), Black: 1108#(and (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1154#(and (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| 1) (= |thread3Thread1of1ForFork0_~i~2#1| 1)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1064#(and (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (= ~res2~0 ~res1~0) (= ~N~0 1)), Black: 1074#(and (forall ((v_subst_9 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (v_subst_10 Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0) (= (+ (select (select |#memory_int#2| v_subst_10) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) v_subst_9)) ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset))) (+ ~res2~0 (select (select |#memory_int#2| v_subst_10) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4) v_subst_9)) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))))) (= ~res2~0 ~res1~0) (= ~N~0 1) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_27| Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (forall ((v_subst_12 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (v_subst_11 Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0) (= (+ ~res1~0 (select (select |#memory_int#2| v_subst_12) v_subst_11) (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| v_subst_12) (+ v_subst_11 (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))))))), Black: 1128#(and (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 928#(and (= ~N~0 1) (or (< |thread3Thread1of1ForFork0_~i~2#1| 1) (and (= ~res2~0 ~res1~0) (= |thread3Thread1of1ForFork0_~i~2#1| 1)))), Black: 837#(and (= ~res2~0 ~res1~0) (= ~N~0 1)), Black: 1092#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))) |thread1Thread1of1ForFork1_~tmp~0#1|)) (= ~res2~0 ~res1~0) (= ~N~0 1) (forall ((v_subst_14 Int) (v_subst_13 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ ~res2~0 (select (select |#memory_int#2| v_subst_14) (+ v_subst_13 (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) (+ ~res1~0 (select (select |#memory_int#2| v_subst_14) v_subst_13) (select (select |#memory_int#2| ~B~0.base) ~B~0.offset))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_27| Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (forall ((v_subst_15 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (v_subst_16 Int)) (or (= (+ ~res2~0 (select (select |#memory_int#2| v_subst_16) (+ v_subst_15 (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| v_subst_16) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) v_subst_15)))) (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0)))), Black: 2150#(and (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res2~0 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (or (forall ((v_subst_39 Int)) (= (+ (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) ~res2~0 (select (select |#memory_int#2| v_subst_39) (* ~M~0 4))) (+ (select (select |#memory_int#2| v_subst_39) 0) (select (select |#memory_int#2| ~B~0.base) 0)))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1068#(and (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (= ~res2~0 ~res1~0) (= ~N~0 1) (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0)))), Black: 1084#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 2110#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0) (forall ((v_subst_33 Int)) (= (+ (select (select |#memory_int#2| v_subst_33) 0) (select (select |#memory_int#2| ~B~0.base) 0)) (+ (select (select |#memory_int#2| v_subst_33) (* ~M~0 4)) (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) ~res2~0)))) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2134#(and (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 834#(and (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1104#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))) |thread1Thread1of1ForFork1_~tmp~0#1|)) (= ~res2~0 ~res1~0) (= ~N~0 1) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (v_subst_22 Int) (v_subst_21 Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| v_subst_22) (+ v_subst_21 (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| v_subst_22) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) v_subst_21)))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (forall ((v_subst_24 Int) (v_subst_23 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int)) (or (= (+ (select (select |#memory_int#2| v_subst_24) (+ v_subst_23 (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset) (select (select |#memory_int#2| v_subst_24) v_subst_23))) (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_27| Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0)))), Black: 2208#(and (= ~A~0.offset 0) (or (forall ((v_subst_46 Int)) (= (+ (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) (select (select |#memory_int#2| v_subst_46) (* ~M~0 4))) (+ (select (select |#memory_int#2| v_subst_46) 0) (select (select |#memory_int#2| ~B~0.base) 0)))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (= ~N~0 1) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (= 0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1082#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 2128#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 1150#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (= ~res2~0 ~res1~0) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 2088#(and (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 1086#(and (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (= ~res2~0 ~res1~0) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0)))), Black: 2114#(and (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res2~0 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2138#(and (= ~A~0.offset 0) (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res2~0 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1168#(and (or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (= ~res2~0 ~res1~0))), Black: 1936#(= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|), Black: 904#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0)), Black: 1138#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)) (or (= ~res2~0 ~res1~0) (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)))), Black: 1146#(and (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1869#(= ~res2~0 ~res1~0), Black: 1132#(and (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (= ~res2~0 ~res1~0) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2094#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 1918#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 997#(forall ((|v_thread3Thread1of1ForFork0_~i~2#1_27| Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_27| 1) ~N~0) (= (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|))), Black: 1180#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (or (< |thread3Thread1of1ForFork0_~i~2#1| 1) (= |thread3Thread1of1ForFork0_~i~2#1| 1))), Black: 2122#(and (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (or (forall ((v_subst_34 Int)) (= (+ (select (select |#memory_int#2| v_subst_34) 0) (select (select |#memory_int#2| ~B~0.base) 0)) (+ (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) ~res2~0 (select (select |#memory_int#2| v_subst_34) (* ~M~0 4))))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res2~0 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1176#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| 1) (= |thread3Thread1of1ForFork0_~i~2#1| 1)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2156#(and (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (or (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))))), Black: 1148#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 2124#(and (or (forall ((v_subst_35 Int)) (= (+ (select (select |#memory_int#2| v_subst_35) 0) (select (select |#memory_int#2| ~B~0.base) 0)) (+ (select (select |#memory_int#2| v_subst_35) (* ~M~0 4)) (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) ~res2~0))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1100#(and (or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (= (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))) |thread1Thread1of1ForFork1_~tmp~0#1|)) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_27| Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_27| 1) ~N~0) (= (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|)))), Black: 2120#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))))) (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2102#(and (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res2~0 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 986#(or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 2132#(and (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (or (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 823#true, Black: 1174#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (= ~res2~0 ~res1~0) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 2130#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (forall ((v_subst_36 Int)) (= (+ (select (select |#memory_int#2| v_subst_36) 0) (select (select |#memory_int#2| ~B~0.base) 0)) (+ (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) ~res2~0 (select (select |#memory_int#2| v_subst_36) (* ~M~0 4))))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1156#(and (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|))), Black: 2166#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) 0) (or (forall ((v_subst_41 Int)) (= (+ (select (select |#memory_int#2| v_subst_41) 0) (select (select |#memory_int#2| ~B~0.base) 0)) (+ (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) (select (select |#memory_int#2| v_subst_41) (* ~M~0 4))))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (= ~res1~0 0) (= 0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1172#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2116#(and (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1164#(and (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (or (< |thread3Thread1of1ForFork0_~i~2#1| 1) (= |thread3Thread1of1ForFork0_~i~2#1| 1))), Black: 2112#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2108#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2136#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) 0) (= ~res1~0 0) (= 0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2096#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 2118#(and (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res2~0 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2106#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 2104#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 33#L51true, Black: 2090#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 1864#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2084#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 2092#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 2152#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))))) (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (or (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2192#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (= 0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1868#(and (= ~res2~0 ~res1~0) (= ~N~0 1)), Black: 2168#(and (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0)) (= ~A~0.offset 0) (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (or (forall ((~A~0.base Int)) (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) (+ (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (* ~M~0 4))))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1865#(and (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2146#(and (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res2~0 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (or (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0) (forall ((v_subst_38 Int)) (= (+ (select (select |#memory_int#2| v_subst_38) 0) (select (select |#memory_int#2| ~B~0.base) 0)) (+ (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) ~res2~0 (select (select |#memory_int#2| v_subst_38) (* ~M~0 4)))))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2413#(= ~res1~0 (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)))), Black: 2336#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)))), Black: 2505#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)))), Black: 2513#(and (= ~res1~0 (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 2268#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2517#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))))) (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2509#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)))), Black: 2527#(and (= ~res1~0 (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 2269#(and (= ~res2~0 ~res1~0) (= ~N~0 1)), Black: 2267#(and (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2340#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|), Black: 2523#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 2499#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))))) (= ~N~0 1) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2507#(and (= ~res1~0 (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)))) (= (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 2525#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2497#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 2519#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 2511#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)))), Black: 2515#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)))), Black: 2270#(= ~res2~0 ~res1~0), Black: 75#(<= 1 ~N~0), 2255#true, 2850#true]) [2023-11-29 00:29:49,282 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-29 00:29:49,282 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-29 00:29:49,282 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-29 00:29:49,282 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-29 00:29:58,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([886] L49-->L51: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork1_~i~0#1_7| 4)) (.cse4 (+ |v_thread1Thread1of1ForFork1_plus_#res#1_1| 2147483648))) (let ((.cse3 (<= |v_thread1Thread1of1ForFork1_plus_#res#1_1| (+ 2147483647 v_~res1~0_43))) (.cse0 (<= v_~res1~0_43 .cse4)) (.cse2 (select (select |v_#memory_int#2_79| v_~B~0.base_88) (+ .cse1 v_~B~0.offset_88)))) (and .cse0 (= |v_thread1Thread1of1ForFork1_plus_#res#1_1| (+ (select (select |v_#memory_int#2_79| v_~A~0.base_110) (+ .cse1 v_~A~0.offset_110)) .cse2 v_~res1~0_43)) (not (= (ite (or (<= |v_thread1Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_#res#1_1| v_~res1~0_43)) 1 0) 0)) (not (= (ite (or .cse3 (<= .cse2 0)) 1 0) 0)) (<= 0 (+ |v_thread1Thread1of1ForFork1_~tmp~0#1_3| 2147483648)) (= |v_thread1Thread1of1ForFork1_plus_#res#1_1| |v_thread1Thread1of1ForFork1_~tmp~0#1_3|) (<= |v_thread1Thread1of1ForFork1_~tmp~0#1_3| 2147483647) .cse3 (not (= (ite (or (<= 0 .cse4) (<= v_~res1~0_43 |v_thread1Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (not (= (ite (or .cse0 (<= 0 .cse2)) 1 0) 0))))) InVars {~res1~0=v_~res1~0_43, ~A~0.base=v_~A~0.base_110, ~B~0.base=v_~B~0.base_88, ~A~0.offset=v_~A~0.offset_110, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, #memory_int#2=|v_#memory_int#2_79|, ~B~0.offset=v_~B~0.offset_88} OutVars{~res1~0=v_~res1~0_43, thread1Thread1of1ForFork1_~tmp~0#1=|v_thread1Thread1of1ForFork1_~tmp~0#1_3|, ~A~0.base=v_~A~0.base_110, ~B~0.base=v_~B~0.base_88, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_1|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_1|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_1|, #memory_int#2=|v_#memory_int#2_79|, ~A~0.offset=v_~A~0.offset_110, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_1|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_1|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_1|, ~B~0.offset=v_~B~0.offset_88, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~tmp~0#1, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1][223], [Black: 1514#(and (= ~res2~0 ~res1~0) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))), Black: 1229#(and (= ~res2~0 ~res1~0) (= ~N~0 1)), Black: 1452#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 1476#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 1478#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 1250#(and (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0)), Black: 1456#(and (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 406#(= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))), Black: 504#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (<= ~N~0 1) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 1287#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 1470#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 251#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= ~res1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1266#(and (<= 0 ~M~0) (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0)), Black: 262#(= ~res2~0 ~res1~0), Black: 492#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 1273#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~M~0 0)), Black: 1492#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 494#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 490#(and (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (= (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 1230#(= ~res2~0 ~res1~0), Black: 484#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 510#(and (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (= ~res1~0 (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 1454#(and (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~M~0 0)), Black: 498#(and (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (= ~res1~0 (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)))) (= (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 1516#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))), Black: 508#(and (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))) (= ~res1~0 (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))))), Black: 1490#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (not (= ~A~0.base ~B~0.base)) (or (= ~res1~0 0) (< |thread2Thread1of1ForFork2_~i~1#1| 0)) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 496#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 1448#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= ~M~0 0)), Black: 514#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (<= ~N~0 1)), Black: 1460#(and (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 2790#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 516#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 2834#(and (or (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0))), Black: 1280#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 1450#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 2796#(and (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (or (= ~N~0 1) (< 1 ~N~0)) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 474#(and (= ~res2~0 ~res1~0) (or (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~N~0 2))), Black: 1462#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 2786#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (<= ~N~0 1) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 488#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 500#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= ~N~0 1) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 2820#(and (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (or (= ~N~0 1) (< 1 ~N~0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1466#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (not (= ~A~0.base ~B~0.base)) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 506#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (<= ~N~0 1)), Black: 2784#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2808#(and (or (and (= ~N~0 1) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|)) (< 1 ~N~0)) (or (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (< 1 ~N~0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 480#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (<= ~N~0 1)), Black: 2812#(and (or (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), Black: 502#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (<= ~N~0 1) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0))) (= ~M~0 0)), Black: 2549#true, Black: 476#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (<= ~N~0 1)), Black: 2610#(and (<= (+ ~M~0 1) ~N~0) (<= 0 ~M~0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 261#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|), Black: 2563#(= ~res2~0 ~res1~0), Black: 2624#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 2822#(and (or (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0)) (or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)) (or (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (< (+ |thread1Thread1of1ForFork1_~i~0#1| 1) ~N~0))), 248#true, Black: 789#(and (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 553#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 777#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 765#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0) (= ~M~0 0)), Black: 557#(= ~res2~0 ~res1~0), Black: 779#(and (= ~res2~0 ~res1~0) (forall ((v_subst_3 Int)) (= (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) (select (select |#memory_int#2| v_subst_3) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) (+ ~res1~0 (select (select |#memory_int#2| v_subst_3) ~A~0.offset) (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)))) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) |thread3Thread1of1ForFork0_~tmp~2#1|) (<= ~N~0 1) (forall ((v_subst_4 Int)) (= (+ ~res2~0 (select (select |#memory_int#2| v_subst_4) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))) (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset) (select (select |#memory_int#2| v_subst_4) ~A~0.offset))))), Black: 769#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (<= ~N~0 1)), Black: 803#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 781#(and (= ~res2~0 ~res1~0) (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))) |thread3Thread1of1ForFork0_~tmp~2#1|) (forall ((v_subst_6 Int)) (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset) (select (select |#memory_int#2| v_subst_6) ~A~0.offset)) (+ (select (select |#memory_int#2| v_subst_6) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))))) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) |thread3Thread1of1ForFork0_~tmp~2#1|) (forall ((v_subst_5 Int)) (= (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| v_subst_5) (+ ~A~0.offset (* ~M~0 4)))) (+ (select (select |#memory_int#2| v_subst_5) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)))) (<= ~N~0 1)), Black: 775#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (<= ~N~0 1) (= ~res2~0 0) (= ~M~0 0)), Black: 556#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|), Black: 787#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 1404#(or (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))), Black: 613#(and (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 801#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 799#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 552#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0)), Black: 1826#(and (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 1561#true, Black: 1836#(and (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 785#(and (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))) |thread3Thread1of1ForFork0_~tmp~2#1|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 1643#(= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|), Black: 797#(and (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 1575#(and (= ~res2~0 ~res1~0) (= ~N~0 1)), Black: 1830#(and (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_33| Int)) (or (= (+ (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_33| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_33| 4))) ~res2~0) |thread1Thread1of1ForFork1_~tmp~0#1|) (< 0 |v_thread3Thread1of1ForFork0_~i~2#1_33|) (< |v_thread3Thread1of1ForFork0_~i~2#1_33| ~M~0))) (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))) |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1647#(= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|), Black: 1572#(and (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1838#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 1834#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1573#(and (= ~N~0 1) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 55#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 543#true, Black: 64#(<= (+ ~M~0 1) ~N~0), 2044#(or (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))))), 962#(or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (= ~res2~0 ~res1~0)), 2692#(or (< |thread1Thread1of1ForFork1_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)), 37#L75true, 13#L62true, Black: 1134#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|))), Black: 1108#(and (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1154#(and (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| 1) (= |thread3Thread1of1ForFork0_~i~2#1| 1)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1064#(and (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (= ~res2~0 ~res1~0) (= ~N~0 1)), Black: 1074#(and (forall ((v_subst_9 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (v_subst_10 Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0) (= (+ (select (select |#memory_int#2| v_subst_10) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) v_subst_9)) ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset))) (+ ~res2~0 (select (select |#memory_int#2| v_subst_10) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4) v_subst_9)) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))))) (= ~res2~0 ~res1~0) (= ~N~0 1) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_27| Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (forall ((v_subst_12 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (v_subst_11 Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0) (= (+ ~res1~0 (select (select |#memory_int#2| v_subst_12) v_subst_11) (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| v_subst_12) (+ v_subst_11 (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))))))), Black: 1128#(and (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 928#(and (= ~N~0 1) (or (< |thread3Thread1of1ForFork0_~i~2#1| 1) (and (= ~res2~0 ~res1~0) (= |thread3Thread1of1ForFork0_~i~2#1| 1)))), Black: 837#(and (= ~res2~0 ~res1~0) (= ~N~0 1)), Black: 1092#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))) |thread1Thread1of1ForFork1_~tmp~0#1|)) (= ~res2~0 ~res1~0) (= ~N~0 1) (forall ((v_subst_14 Int) (v_subst_13 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ ~res2~0 (select (select |#memory_int#2| v_subst_14) (+ v_subst_13 (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) (+ ~res1~0 (select (select |#memory_int#2| v_subst_14) v_subst_13) (select (select |#memory_int#2| ~B~0.base) ~B~0.offset))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_27| Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (forall ((v_subst_15 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (v_subst_16 Int)) (or (= (+ ~res2~0 (select (select |#memory_int#2| v_subst_16) (+ v_subst_15 (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| v_subst_16) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) v_subst_15)))) (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0)))), Black: 2150#(and (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res2~0 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (or (forall ((v_subst_39 Int)) (= (+ (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) ~res2~0 (select (select |#memory_int#2| v_subst_39) (* ~M~0 4))) (+ (select (select |#memory_int#2| v_subst_39) 0) (select (select |#memory_int#2| ~B~0.base) 0)))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1068#(and (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (= ~res2~0 ~res1~0) (= ~N~0 1) (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0)))), Black: 1084#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 2110#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0) (forall ((v_subst_33 Int)) (= (+ (select (select |#memory_int#2| v_subst_33) 0) (select (select |#memory_int#2| ~B~0.base) 0)) (+ (select (select |#memory_int#2| v_subst_33) (* ~M~0 4)) (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) ~res2~0)))) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2134#(and (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 834#(and (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1104#(and (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))) |thread1Thread1of1ForFork1_~tmp~0#1|)) (= ~res2~0 ~res1~0) (= ~N~0 1) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (v_subst_22 Int) (v_subst_21 Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| v_subst_22) (+ v_subst_21 (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| v_subst_22) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) v_subst_21)))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (forall ((v_subst_24 Int) (v_subst_23 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int)) (or (= (+ (select (select |#memory_int#2| v_subst_24) (+ v_subst_23 (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset) (select (select |#memory_int#2| v_subst_24) v_subst_23))) (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_27| Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0)))), Black: 2208#(and (= ~A~0.offset 0) (or (forall ((v_subst_46 Int)) (= (+ (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) (select (select |#memory_int#2| v_subst_46) (* ~M~0 4))) (+ (select (select |#memory_int#2| v_subst_46) 0) (select (select |#memory_int#2| ~B~0.base) 0)))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (= ~N~0 1) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (= 0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1082#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~M~0 0)), Black: 2128#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 1150#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (= ~res2~0 ~res1~0) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 2088#(and (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 1086#(and (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (= ~res2~0 ~res1~0) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~B~0.offset)) (select (select |#memory_int#2| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset))) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0)))), Black: 2114#(and (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res2~0 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2138#(and (= ~A~0.offset 0) (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res2~0 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1168#(and (or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (or (< |thread3Thread1of1ForFork0_~i~2#1| ~N~0) (= ~res2~0 ~res1~0))), Black: 1936#(= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|), Black: 904#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0)), Black: 1138#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)) (or (= ~res2~0 ~res1~0) (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)))), Black: 1146#(and (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1869#(= ~res2~0 ~res1~0), Black: 1132#(and (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (= ~res2~0 ~res1~0) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2094#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 997#(forall ((|v_thread3Thread1of1ForFork0_~i~2#1_27| Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_27| 1) ~N~0) (= (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|))), Black: 1918#(and (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 1180#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (or (< |thread3Thread1of1ForFork0_~i~2#1| 1) (= |thread3Thread1of1ForFork0_~i~2#1| 1))), Black: 2122#(and (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (or (forall ((v_subst_34 Int)) (= (+ (select (select |#memory_int#2| v_subst_34) 0) (select (select |#memory_int#2| ~B~0.base) 0)) (+ (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) ~res2~0 (select (select |#memory_int#2| v_subst_34) (* ~M~0 4))))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res2~0 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1176#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| 1) (= |thread3Thread1of1ForFork0_~i~2#1| 1)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2156#(and (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (or (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))))), Black: 1148#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 2124#(and (or (forall ((v_subst_35 Int)) (= (+ (select (select |#memory_int#2| v_subst_35) 0) (select (select |#memory_int#2| ~B~0.base) 0)) (+ (select (select |#memory_int#2| v_subst_35) (* ~M~0 4)) (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) ~res2~0))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 28#L101-1true, Black: 1100#(and (or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (= (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))) |thread1Thread1of1ForFork1_~tmp~0#1|)) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_27| Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (< (+ |v_thread3Thread1of1ForFork0_~i~2#1_27| 1) ~N~0) (= (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4)))) |thread1Thread1of1ForFork1_~tmp~0#1|)))), Black: 2120#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))))) (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2102#(and (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res2~0 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 986#(or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 2132#(and (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (or (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 823#true, Black: 1174#(and (or (not (= |thread3Thread1of1ForFork0_~i~2#1| 0)) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (= ~res2~0 ~res1~0) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 2130#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (forall ((v_subst_36 Int)) (= (+ (select (select |#memory_int#2| v_subst_36) 0) (select (select |#memory_int#2| ~B~0.base) 0)) (+ (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) ~res2~0 (select (select |#memory_int#2| v_subst_36) (* ~M~0 4))))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1156#(and (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|))), Black: 2166#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) 0) (or (forall ((v_subst_41 Int)) (= (+ (select (select |#memory_int#2| v_subst_41) 0) (select (select |#memory_int#2| ~B~0.base) 0)) (+ (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) (select (select |#memory_int#2| v_subst_41) (* ~M~0 4))))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (= ~res1~0 0) (= 0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1172#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (<= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2116#(and (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1164#(and (forall ((~A~0.offset Int) (|v_thread3Thread1of1ForFork0_~i~2#1_27| Int) (~A~0.base Int)) (or (< ~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_27|) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))) (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_27| 4))))) (< |v_thread3Thread1of1ForFork0_~i~2#1_27| 0))) (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (or (< |thread3Thread1of1ForFork0_~i~2#1| 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|)) (or (< |thread3Thread1of1ForFork0_~i~2#1| 1) (= |thread3Thread1of1ForFork0_~i~2#1| 1))), Black: 2112#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2108#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2136#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) 0) (= ~res1~0 0) (= 0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2096#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 2118#(and (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res2~0 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2106#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 2104#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 33#L51true, Black: 2090#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 1864#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2084#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 2092#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= |thread2Thread1of1ForFork2_~i~1#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 2152#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))))) (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (or (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))))))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2192#(and (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0) (= 0 |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1868#(and (= ~res2~0 ~res1~0) (= ~N~0 1)), Black: 2168#(and (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res1~0 0)) (= ~A~0.offset 0) (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~B~0.offset 0) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res2~0 |thread1Thread1of1ForFork1_~tmp~0#1|) (or (forall ((~A~0.base Int)) (= (+ ~res1~0 (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) (+ (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (* ~M~0 4))))) (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0)) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 1865#(and (= ~N~0 1) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2146#(and (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (or (< 0 |thread3Thread1of1ForFork0_~i~2#1|) (= ~res2~0 0)) (<= 0 |thread3Thread1of1ForFork0_~i~2#1|) (= |thread3Thread1of1ForFork0_~tmp~2#1| |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 0) (or (< |thread2Thread1of1ForFork2_~i~1#1| ~M~0) (forall ((v_subst_38 Int)) (= (+ (select (select |#memory_int#2| v_subst_38) 0) (select (select |#memory_int#2| ~B~0.base) 0)) (+ (select (select |#memory_int#2| ~B~0.base) (* ~M~0 4)) ~res2~0 (select (select |#memory_int#2| v_subst_38) (* ~M~0 4)))))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2413#(= ~res1~0 (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)))), Black: 2336#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res2~0 0) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)))), Black: 2505#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)))), Black: 2513#(and (= ~res1~0 (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 2268#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2517#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))))) (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2509#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)))), Black: 2527#(and (= ~res1~0 (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)))) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 2269#(and (= ~res2~0 ~res1~0) (= ~N~0 1)), Black: 2267#(and (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2340#(= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|), Black: 2523#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 2499#(and (= ~res2~0 ~res1~0) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))))) (= ~N~0 1) (forall ((~A~0.base Int)) (= (+ (select (select |#memory_int#2| ~A~0.base) ~A~0.offset) ~res1~0 (select (select |#memory_int#2| ~B~0.base) ~B~0.offset)) (+ (select (select |#memory_int#2| ~B~0.base) (+ ~B~0.offset (* ~M~0 4))) ~res2~0 (select (select |#memory_int#2| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))))) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2507#(and (= ~res1~0 (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset)))) (= (+ (select (select |#memory_int#2| ~A~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~A~0.offset)) ~res2~0 (select (select |#memory_int#2| ~B~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~B~0.offset))) |thread1Thread1of1ForFork1_~tmp~0#1|)), Black: 2525#(and (= ~res2~0 ~res1~0) (= ~N~0 1) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 2497#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 0) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= ~M~0 0)), Black: 2519#(and (= ~res2~0 ~res1~0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|)), Black: 2511#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~N~0 1) (= ~B~0.offset 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~res2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)))), Black: 2515#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= ~A~0.offset 0) (= ~B~0.offset 0) (= ~res1~0 |thread3Thread1of1ForFork0_~tmp~2#1|) (= ~res2~0 0) (= (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)) |thread1Thread1of1ForFork1_~tmp~0#1|) (= ~res1~0 (+ (select (select |#memory_int#2| ~B~0.base) 0) (select (select |#memory_int#2| ~A~0.base) 0)))), Black: 2270#(= ~res2~0 ~res1~0), Black: 75#(<= 1 ~N~0), 2255#true, 2850#true]) [2023-11-29 00:29:58,526 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-29 00:29:58,526 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-29 00:29:58,526 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-29 00:29:58,526 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-29 00:30:49,883 INFO L124 PetriNetUnfolderBase]: 69760/99062 cut-off events. [2023-11-29 00:30:49,883 INFO L125 PetriNetUnfolderBase]: For 2231082/2232412 co-relation queries the response was YES. [2023-11-29 00:30:53,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770508 conditions, 99062 events. 69760/99062 cut-off events. For 2231082/2232412 co-relation queries the response was YES. Maximal size of possible extension queue 4539. Compared 715704 event pairs, 7841 based on Foata normal form. 563/98929 useless extension candidates. Maximal degree in co-relation 769528. Up to 84362 conditions per place. [2023-11-29 00:30:54,165 INFO L140 encePairwiseOnDemand]: 23/40 looper letters, 4092 selfloop transitions, 980 changer transitions 1/5146 dead transitions. [2023-11-29 00:30:54,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 5146 transitions, 94497 flow [2023-11-29 00:30:54,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-29 00:30:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-11-29 00:30:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 538 transitions. [2023-11-29 00:30:54,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39558823529411763 [2023-11-29 00:30:54,167 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 538 transitions. [2023-11-29 00:30:54,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 538 transitions. [2023-11-29 00:30:54,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:30:54,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 538 transitions. [2023-11-29 00:30:54,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 15.823529411764707) internal successors, (538), 34 states have internal predecessors, (538), 0 states have call successors, (0), 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:30:54,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 40.0) internal successors, (1400), 35 states have internal predecessors, (1400), 0 states have call successors, (0), 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:30:54,171 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 40.0) internal successors, (1400), 35 states have internal predecessors, (1400), 0 states have call successors, (0), 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:30:54,171 INFO L175 Difference]: Start difference. First operand has 573 places, 4456 transitions, 74507 flow. Second operand 34 states and 538 transitions. [2023-11-29 00:30:54,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 5146 transitions, 94497 flow