Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r575-smll-171734919500061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MedleyA-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919500061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-08-UpperBounds-00
FORMULA_NAME MedleyA-PT-08-UpperBounds-01
FORMULA_NAME MedleyA-PT-08-UpperBounds-02
FORMULA_NAME MedleyA-PT-08-UpperBounds-03
FORMULA_NAME MedleyA-PT-08-UpperBounds-04
FORMULA_NAME MedleyA-PT-08-UpperBounds-05
FORMULA_NAME MedleyA-PT-08-UpperBounds-06
FORMULA_NAME MedleyA-PT-08-UpperBounds-07
FORMULA_NAME MedleyA-PT-08-UpperBounds-08
FORMULA_NAME MedleyA-PT-08-UpperBounds-09
FORMULA_NAME MedleyA-PT-08-UpperBounds-10
FORMULA_NAME MedleyA-PT-08-UpperBounds-11
FORMULA_NAME MedleyA-PT-08-UpperBounds-12
FORMULA_NAME MedleyA-PT-08-UpperBounds-13
FORMULA_NAME MedleyA-PT-08-UpperBounds-14
FORMULA_NAME MedleyA-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717355561132

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 19:12:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 19:12:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:12:43] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2024-06-02 19:12:43] [INFO ] Transformed 147 places.
[2024-06-02 19:12:43] [INFO ] Transformed 312 transitions.
[2024-06-02 19:12:43] [INFO ] Found NUPN structural information;
[2024-06-02 19:12:44] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 22 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 312 rows 147 cols
[2024-06-02 19:12:44] [INFO ] Computed 11 invariants in 65 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (499 resets) in 90 ms. (109 steps per ms)
FORMULA MedleyA-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (1193 resets) in 229 ms. (391 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 19:12:44] [INFO ] Invariant cache hit.
[2024-06-02 19:12:44] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2024-06-02 19:12:44] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:12:45] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2024-06-02 19:12:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:12:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2024-06-02 19:12:45] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:12:45] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-06-02 19:12:45] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 89 ms.
[2024-06-02 19:12:46] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 28 ms to minimize.
[2024-06-02 19:12:46] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 4 ms to minimize.
[2024-06-02 19:12:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 517 ms
[2024-06-02 19:12:47] [INFO ] Added : 78 causal constraints over 16 iterations in 1383 ms. Result :sat
Minimization took 351 ms.
[2024-06-02 19:12:47] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 19:12:47] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:12:47] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-06-02 19:12:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:12:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2024-06-02 19:12:47] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:12:48] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2024-06-02 19:12:48] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 3 ms to minimize.
[2024-06-02 19:12:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2024-06-02 19:12:48] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 70 ms.
[2024-06-02 19:12:49] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 3 ms to minimize.
[2024-06-02 19:12:49] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-06-02 19:12:49] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2024-06-02 19:12:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 593 ms
[2024-06-02 19:12:49] [INFO ] Added : 79 causal constraints over 16 iterations in 1277 ms. Result :sat
Minimization took 323 ms.
[2024-06-02 19:12:50] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 19:12:50] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:12:50] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-06-02 19:12:50] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 72 ms.
[2024-06-02 19:12:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:12:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 19:12:50] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 6 ms returned sat
[2024-06-02 19:12:50] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-06-02 19:12:50] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 49 ms.
[2024-06-02 19:12:51] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-06-02 19:12:51] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
[2024-06-02 19:12:51] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 3 ms to minimize.
[2024-06-02 19:12:52] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 2 ms to minimize.
[2024-06-02 19:12:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 753 ms
[2024-06-02 19:12:52] [INFO ] Added : 76 causal constraints over 16 iterations in 1418 ms. Result :sat
Minimization took 324 ms.
[2024-06-02 19:12:52] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 19:12:52] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:12:52] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-06-02 19:12:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:12:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 19:12:52] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:12:53] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-06-02 19:12:53] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 3 ms to minimize.
[2024-06-02 19:12:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-06-02 19:12:53] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 46 ms.
[2024-06-02 19:12:53] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:12:54] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:12:54] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:12:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 346 ms
[2024-06-02 19:12:54] [INFO ] Added : 77 causal constraints over 17 iterations in 977 ms. Result :sat
Minimization took 232 ms.
[2024-06-02 19:12:54] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 19:12:54] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:12:54] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-06-02 19:12:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:12:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 19:12:54] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:12:54] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-06-02 19:12:54] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 24 ms.
[2024-06-02 19:12:55] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2024-06-02 19:12:55] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:12:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2024-06-02 19:12:55] [INFO ] Added : 83 causal constraints over 18 iterations in 816 ms. Result :sat
Minimization took 220 ms.
[2024-06-02 19:12:55] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 19:12:55] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:12:56] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-06-02 19:12:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:12:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 19:12:56] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:12:56] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-06-02 19:12:56] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-06-02 19:12:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2024-06-02 19:12:56] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 32 ms.
[2024-06-02 19:12:56] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2024-06-02 19:12:57] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:12:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2024-06-02 19:12:57] [INFO ] Added : 87 causal constraints over 18 iterations in 791 ms. Result :sat
Minimization took 207 ms.
[2024-06-02 19:12:57] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 19:12:57] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:12:57] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-06-02 19:12:57] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 47 ms.
[2024-06-02 19:12:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:12:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 19:12:57] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:12:57] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2024-06-02 19:12:57] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 38 ms.
[2024-06-02 19:12:58] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 3 ms to minimize.
[2024-06-02 19:12:58] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 2 ms to minimize.
[2024-06-02 19:12:58] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:12:59] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:12:59] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:12:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 823 ms
[2024-06-02 19:12:59] [INFO ] Added : 75 causal constraints over 16 iterations in 1442 ms. Result :sat
Minimization took 230 ms.
[2024-06-02 19:12:59] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 19:12:59] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:12:59] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-06-02 19:12:59] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:12:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:12:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 19:12:59] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 19:13:00] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-06-02 19:13:00] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:13:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2024-06-02 19:13:00] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 34 ms.
[2024-06-02 19:13:00] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:13:00] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:13:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 256 ms
[2024-06-02 19:13:00] [INFO ] Added : 80 causal constraints over 17 iterations in 707 ms. Result :sat
Minimization took 283 ms.
[2024-06-02 19:13:01] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 19:13:01] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:13:01] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-06-02 19:13:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2024-06-02 19:13:01] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 19:13:01] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-06-02 19:13:01] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 39 ms.
[2024-06-02 19:13:02] [INFO ] Added : 71 causal constraints over 15 iterations in 552 ms. Result :sat
Minimization took 311 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 312/312 transitions.
Graph (complete) has 508 edges and 147 vertex of which 140 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 140 transition count 275
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 64 place count 117 transition count 269
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 116 transition count 268
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 116 transition count 265
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 113 transition count 265
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 99 place count 86 transition count 231
Iterating global reduction 3 with 27 rules applied. Total rules applied 126 place count 86 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 126 place count 86 transition count 230
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 85 transition count 230
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 136 place count 77 transition count 212
Iterating global reduction 3 with 8 rules applied. Total rules applied 144 place count 77 transition count 212
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 74 transition count 204
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 74 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 73 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 73 transition count 201
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 178 place count 60 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 179 place count 60 transition count 187
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 181 place count 58 transition count 185
Iterating global reduction 4 with 2 rules applied. Total rules applied 183 place count 58 transition count 185
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 193 place count 53 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 4 with 23 rules applied. Total rules applied 216 place count 53 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 216 place count 53 transition count 182
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 218 place count 52 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 222 place count 50 transition count 205
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 227 place count 50 transition count 200
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 232 place count 45 transition count 200
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 234 place count 45 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 236 place count 43 transition count 199
Applied a total of 236 rules in 159 ms. Remains 43 /147 variables (removed 104) and now considering 199/312 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 43/147 places, 199/312 transitions.
[2024-06-02 19:13:03] [INFO ] Flow matrix only has 163 transitions (discarded 36 similar events)
// Phase 1: matrix 163 rows 43 cols
[2024-06-02 19:13:03] [INFO ] Computed 11 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (62 resets) in 804 ms. (1242 steps per ms)
FORMULA MedleyA-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000001 steps (153 resets) in 2554 ms. (1956 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-02 19:13:07] [INFO ] Flow matrix only has 163 transitions (discarded 36 similar events)
[2024-06-02 19:13:07] [INFO ] Invariant cache hit.
[2024-06-02 19:13:07] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 19:13:07] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-06-02 19:13:07] [INFO ] [Real]Added 82 Read/Feed constraints in 12 ms returned sat
[2024-06-02 19:13:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Nat]Added 82 Read/Feed constraints in 14 ms returned sat
[2024-06-02 19:13:07] [INFO ] Computed and/alt/rep : 11/61/11 causal constraints (skipped 148 transitions) in 13 ms.
[2024-06-02 19:13:07] [INFO ] Added : 0 causal constraints over 0 iterations in 27 ms. Result :sat
Minimization took 69 ms.
[2024-06-02 19:13:07] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Real]Added 82 Read/Feed constraints in 11 ms returned sat
[2024-06-02 19:13:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Nat]Added 82 Read/Feed constraints in 21 ms returned sat
[2024-06-02 19:13:07] [INFO ] Computed and/alt/rep : 11/61/11 causal constraints (skipped 148 transitions) in 21 ms.
[2024-06-02 19:13:07] [INFO ] Added : 1 causal constraints over 1 iterations in 59 ms. Result :sat
Minimization took 110 ms.
[2024-06-02 19:13:07] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Real]Added 82 Read/Feed constraints in 18 ms returned sat
[2024-06-02 19:13:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 19:13:07] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:08] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-02 19:13:08] [INFO ] [Nat]Added 82 Read/Feed constraints in 23 ms returned sat
[2024-06-02 19:13:08] [INFO ] Computed and/alt/rep : 11/61/11 causal constraints (skipped 148 transitions) in 24 ms.
[2024-06-02 19:13:08] [INFO ] Added : 0 causal constraints over 0 iterations in 49 ms. Result :sat
Minimization took 107 ms.
[2024-06-02 19:13:08] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:13:08] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:08] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-06-02 19:13:08] [INFO ] [Real]Added 82 Read/Feed constraints in 18 ms returned sat
[2024-06-02 19:13:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:13:08] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 19:13:08] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-02 19:13:08] [INFO ] [Nat]Added 82 Read/Feed constraints in 24 ms returned sat
[2024-06-02 19:13:08] [INFO ] Computed and/alt/rep : 11/61/11 causal constraints (skipped 148 transitions) in 24 ms.
[2024-06-02 19:13:08] [INFO ] Added : 0 causal constraints over 0 iterations in 47 ms. Result :sat
Minimization took 108 ms.
[2024-06-02 19:13:08] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 19:13:08] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:08] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-02 19:13:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 19:13:08] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:08] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-06-02 19:13:08] [INFO ] [Nat]Added 82 Read/Feed constraints in 22 ms returned sat
[2024-06-02 19:13:08] [INFO ] Computed and/alt/rep : 11/61/11 causal constraints (skipped 148 transitions) in 24 ms.
[2024-06-02 19:13:08] [INFO ] Added : 1 causal constraints over 1 iterations in 60 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA MedleyA-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 1]
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 199/199 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 41 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 41 transition count 195
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 41 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 40 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 40 transition count 192
Applied a total of 10 rules in 49 ms. Remains 40 /43 variables (removed 3) and now considering 192/199 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 40/43 places, 192/199 transitions.
[2024-06-02 19:13:09] [INFO ] Flow matrix only has 158 transitions (discarded 34 similar events)
// Phase 1: matrix 158 rows 40 cols
[2024-06-02 19:13:09] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 1]
FORMULA MedleyA-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (47 resets) in 1019 ms. (980 steps per ms)
BEST_FIRST walk for 2000000 steps (32 resets) in 943 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 19:13:11] [INFO ] Flow matrix only has 158 transitions (discarded 34 similar events)
[2024-06-02 19:13:11] [INFO ] Invariant cache hit.
[2024-06-02 19:13:11] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 19:13:11] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:11] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-02 19:13:11] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-06-02 19:13:11] [INFO ] [Real]Added 84 Read/Feed constraints in 16 ms returned sat
[2024-06-02 19:13:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:13:11] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:11] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-02 19:13:11] [INFO ] [Nat]Added 84 Read/Feed constraints in 25 ms returned sat
[2024-06-02 19:13:11] [INFO ] Computed and/alt/rep : 12/68/12 causal constraints (skipped 142 transitions) in 17 ms.
[2024-06-02 19:13:11] [INFO ] Added : 0 causal constraints over 0 iterations in 35 ms. Result :sat
Minimization took 113 ms.
[2024-06-02 19:13:11] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:13:11] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:11] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 19:13:11] [INFO ] [Real]Added 84 Read/Feed constraints in 14 ms returned sat
[2024-06-02 19:13:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:13:11] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 19:13:11] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 19:13:11] [INFO ] [Nat]Added 84 Read/Feed constraints in 17 ms returned sat
[2024-06-02 19:13:11] [INFO ] Computed and/alt/rep : 12/68/12 causal constraints (skipped 142 transitions) in 14 ms.
[2024-06-02 19:13:11] [INFO ] Added : 1 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 40 /40 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 40/40 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 40 /40 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-06-02 19:13:12] [INFO ] Flow matrix only has 158 transitions (discarded 34 similar events)
[2024-06-02 19:13:12] [INFO ] Invariant cache hit.
[2024-06-02 19:13:12] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 19:13:12] [INFO ] Flow matrix only has 158 transitions (discarded 34 similar events)
[2024-06-02 19:13:12] [INFO ] Invariant cache hit.
[2024-06-02 19:13:12] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-06-02 19:13:12] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-06-02 19:13:12] [INFO ] Redundant transitions in 9 ms returned []
Running 188 sub problems to find dead transitions.
[2024-06-02 19:13:12] [INFO ] Flow matrix only has 158 transitions (discarded 34 similar events)
[2024-06-02 19:13:12] [INFO ] Invariant cache hit.
[2024-06-02 19:13:12] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/40 variables, 6/11 constraints. Problems are: Problem set: 46 solved, 142 unsolved
[2024-06-02 19:13:14] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
Problem TDEAD145 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 1/12 constraints. Problems are: Problem set: 47 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 47 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 158/198 variables, 40/52 constraints. Problems are: Problem set: 47 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 84/136 constraints. Problems are: Problem set: 47 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/136 constraints. Problems are: Problem set: 47 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/136 constraints. Problems are: Problem set: 47 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 136 constraints, problems are : Problem set: 47 solved, 141 unsolved in 4934 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 47 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 47 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 47 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 6/11 constraints. Problems are: Problem set: 47 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 1/12 constraints. Problems are: Problem set: 47 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 47 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 158/198 variables, 40/52 constraints. Problems are: Problem set: 47 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 84/136 constraints. Problems are: Problem set: 47 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 141/277 constraints. Problems are: Problem set: 47 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/277 constraints. Problems are: Problem set: 47 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/277 constraints. Problems are: Problem set: 47 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 277 constraints, problems are : Problem set: 47 solved, 141 unsolved in 7374 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 141/188 constraints, Known Traps: 1/1 constraints]
After SMT, in 12953ms problems are : Problem set: 47 solved, 141 unsolved
Search for dead transitions found 47 dead transitions in 12973ms
Found 47 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 40/40 places, 145/192 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 145
Applied a total of 1 rules in 8 ms. Remains 39 /40 variables (removed 1) and now considering 145/145 (removed 0) transitions.
// Phase 1: matrix 145 rows 39 cols
[2024-06-02 19:13:25] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:13:25] [INFO ] Implicit Places using invariants in 90 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 38/40 places, 145/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 38 /38 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 13414 ms. Remains : 38/40 places, 145/192 transitions.
// Phase 1: matrix 145 rows 38 cols
[2024-06-02 19:13:25] [INFO ] Computed 9 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (31 resets) in 740 ms. (1349 steps per ms)
BEST_FIRST walk for 2000001 steps (16 resets) in 739 ms. (2702 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 19:13:26] [INFO ] Invariant cache hit.
[2024-06-02 19:13:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 19:13:26] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:13:26] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-02 19:13:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-02 19:13:26] [INFO ] [Real]Added 72 Read/Feed constraints in 10 ms returned sat
[2024-06-02 19:13:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 19:13:27] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 19:13:27] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-02 19:13:27] [INFO ] [Nat]Added 72 Read/Feed constraints in 13 ms returned sat
[2024-06-02 19:13:27] [INFO ] Computed and/alt/rep : 14/73/14 causal constraints (skipped 127 transitions) in 12 ms.
[2024-06-02 19:13:27] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Minimization took 49 ms.
[2024-06-02 19:13:27] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 19:13:27] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:13:27] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-02 19:13:27] [INFO ] [Real]Added 72 Read/Feed constraints in 13 ms returned sat
[2024-06-02 19:13:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:13:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 19:13:27] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 19:13:27] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-06-02 19:13:27] [INFO ] [Nat]Added 72 Read/Feed constraints in 10 ms returned sat
[2024-06-02 19:13:27] [INFO ] Computed and/alt/rep : 14/73/14 causal constraints (skipped 127 transitions) in 12 ms.
[2024-06-02 19:13:27] [INFO ] Added : 1 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 145/145 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 38/38 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 145/145 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2024-06-02 19:13:27] [INFO ] Invariant cache hit.
[2024-06-02 19:13:27] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 19:13:27] [INFO ] Invariant cache hit.
[2024-06-02 19:13:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-02 19:13:27] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-06-02 19:13:27] [INFO ] Redundant transitions in 8 ms returned []
Running 141 sub problems to find dead transitions.
[2024-06-02 19:13:27] [INFO ] Invariant cache hit.
[2024-06-02 19:13:27] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 145/183 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 72/119 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/183 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 119 constraints, problems are : Problem set: 0 solved, 141 unsolved in 4465 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 145/183 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 72/119 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 141/260 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 260 constraints, problems are : Problem set: 0 solved, 141 unsolved in 6268 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
After SMT, in 11012ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 11016ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11293 ms. Remains : 38/38 places, 145/145 transitions.
RANDOM walk for 40000 steps (122 resets) in 1183 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (127 resets) in 363 ms. (109 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (37 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
[2024-06-02 19:13:39] [INFO ] Invariant cache hit.
[2024-06-02 19:13:39] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/38 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 145/183 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 72/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 119 constraints, problems are : Problem set: 0 solved, 2 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:13:39] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 145/183 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 72/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/183 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 122 constraints, problems are : Problem set: 0 solved, 2 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 347ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 145/145 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 37 transition count 144
Applied a total of 2 rules in 5 ms. Remains 37 /38 variables (removed 1) and now considering 144/145 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 37/38 places, 144/145 transitions.
RANDOM walk for 40000 steps (220 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (49 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (168 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7541 steps, run visited all 2 properties in 66 ms. (steps per millisecond=114 )
Probabilistic random walk after 7541 steps, saw 2320 distinct states, run finished after 71 ms. (steps per millisecond=106 ) properties seen :2
FORMULA MedleyA-PT-08-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA MedleyA-PT-08-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 56403 ms.
ITS solved all properties within timeout

BK_STOP 1717355620000

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r575-smll-171734919500061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-08.tgz
mv MedleyA-PT-08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;