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-171734919400029.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-04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919400029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 28K 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-04-UpperBounds-00
FORMULA_NAME MedleyA-PT-04-UpperBounds-01
FORMULA_NAME MedleyA-PT-04-UpperBounds-02
FORMULA_NAME MedleyA-PT-04-UpperBounds-03
FORMULA_NAME MedleyA-PT-04-UpperBounds-04
FORMULA_NAME MedleyA-PT-04-UpperBounds-05
FORMULA_NAME MedleyA-PT-04-UpperBounds-06
FORMULA_NAME MedleyA-PT-04-UpperBounds-07
FORMULA_NAME MedleyA-PT-04-UpperBounds-08
FORMULA_NAME MedleyA-PT-04-UpperBounds-09
FORMULA_NAME MedleyA-PT-04-UpperBounds-10
FORMULA_NAME MedleyA-PT-04-UpperBounds-11
FORMULA_NAME MedleyA-PT-04-UpperBounds-12
FORMULA_NAME MedleyA-PT-04-UpperBounds-13
FORMULA_NAME MedleyA-PT-04-UpperBounds-14
FORMULA_NAME MedleyA-PT-04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717352426203

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-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:20:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:20:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:20:29] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-06-02 18:20:29] [INFO ] Transformed 115 places.
[2024-06-02 18:20:29] [INFO ] Transformed 107 transitions.
[2024-06-02 18:20:29] [INFO ] Found NUPN structural information;
[2024-06-02 18:20:29] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 21 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 107 rows 115 cols
[2024-06-02 18:20:29] [INFO ] Computed 9 invariants in 38 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 (272 resets) in 68 ms. (144 steps per ms)
FORMULA MedleyA-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (374 resets) in 121 ms. (409 steps per ms)
FORMULA MedleyA-PT-04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 18:20:29] [INFO ] Invariant cache hit.
[2024-06-02 18:20:30] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2024-06-02 18:20:30] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-06-02 18:20:30] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 25 ms to minimize.
[2024-06-02 18:20:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:20:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2024-06-02 18:20:30] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-06-02 18:20:30] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 4 ms to minimize.
[2024-06-02 18:20:31] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 3 ms to minimize.
[2024-06-02 18:20:31] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:20:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 406 ms
[2024-06-02 18:20:31] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 24 ms.
[2024-06-02 18:20:31] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 3 ms to minimize.
[2024-06-02 18:20:31] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:20:31] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:20:31] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:20:32] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-06-02 18:20:32] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:20:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 532 ms
[2024-06-02 18:20:32] [INFO ] Added : 95 causal constraints over 19 iterations in 968 ms. Result :sat
Minimization took 58 ms.
[2024-06-02 18:20:32] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 18:20:32] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-06-02 18:20:32] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:20:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:20:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-06-02 18:20:32] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-06-02 18:20:32] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:20:32] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-06-02 18:20:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2024-06-02 18:20:32] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 17 ms.
[2024-06-02 18:20:33] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:20:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-06-02 18:20:33] [INFO ] Added : 75 causal constraints over 15 iterations in 372 ms. Result :sat
Minimization took 89 ms.
[2024-06-02 18:20:33] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 18:20:33] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-06-02 18:20:33] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-06-02 18:20:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:20:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-06-02 18:20:33] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-06-02 18:20:33] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:20:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-06-02 18:20:33] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 17 ms.
[2024-06-02 18:20:34] [INFO ] Added : 89 causal constraints over 18 iterations in 335 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 107/107 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 115 transition count 83
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 91 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 48 place count 91 transition count 77
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 85 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 78 transition count 70
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 78 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 74 place count 78 transition count 69
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 77 transition count 69
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 118 place count 56 transition count 48
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 56 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 55 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 54 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 53 transition count 46
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 53 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 124 place count 52 transition count 45
Applied a total of 124 rules in 117 ms. Remains 52 /115 variables (removed 63) and now considering 45/107 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 52/115 places, 45/107 transitions.
// Phase 1: matrix 45 rows 52 cols
[2024-06-02 18:20:34] [INFO ] Computed 8 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (109033 resets) in 1085 ms. (920 steps per ms)
FORMULA MedleyA-PT-04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000000 steps (103747 resets) in 936 ms. (2134 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 18:20:37] [INFO ] Invariant cache hit.
[2024-06-02 18:20:37] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:20:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-02 18:20:37] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:20:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:20:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:20:37] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-02 18:20:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:20:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-06-02 18:20:37] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 5 ms.
[2024-06-02 18:20:37] [INFO ] Added : 33 causal constraints over 7 iterations in 49 ms. Result :sat
Minimization took 22 ms.
[2024-06-02 18:20:37] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 18:20:37] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-02 18:20:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:20:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:20:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:20:37] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-06-02 18:20:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:20:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-06-02 18:20:37] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 6 ms.
[2024-06-02 18:20:37] [INFO ] Added : 42 causal constraints over 9 iterations in 91 ms. Result :sat
Minimization took 29 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 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 52/52 places, 45/45 transitions.
[2024-06-02 18:20:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (109144 resets) in 1144 ms. (873 steps per ms)
BEST_FIRST walk for 2000000 steps (103739 resets) in 1036 ms. (1928 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 18:20:39] [INFO ] Invariant cache hit.
[2024-06-02 18:20:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:20:39] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-06-02 18:20:39] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:20:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:20:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:20:40] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-02 18:20:40] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:20:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-06-02 18:20:40] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 5 ms.
[2024-06-02 18:20:40] [INFO ] Added : 33 causal constraints over 7 iterations in 53 ms. Result :sat
Minimization took 17 ms.
[2024-06-02 18:20:40] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 18:20:40] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-06-02 18:20:40] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:20:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:20:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:20:40] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-06-02 18:20:40] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:20:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-06-02 18:20:40] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 7 ms.
[2024-06-02 18:20:40] [INFO ] Added : 42 causal constraints over 9 iterations in 83 ms. Result :sat
Minimization took 31 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 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 10 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 52/52 places, 45/45 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 7 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-02 18:20:40] [INFO ] Invariant cache hit.
[2024-06-02 18:20:40] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 18:20:40] [INFO ] Invariant cache hit.
[2024-06-02 18:20:40] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-06-02 18:20:40] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-06-02 18:20:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-02 18:20:41] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:20:41] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:20:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:20:41] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:20:41] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/97 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/97 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 65 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1442 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/97 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 44/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-02 18:20:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 110 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1967 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 6/6 constraints]
After SMT, in 3520ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 3535ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3760 ms. Remains : 52/52 places, 45/45 transitions.
RANDOM walk for 40000 steps (4338 resets) in 1740 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2060 resets) in 458 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (2049 resets) in 332 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (2032 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2086 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 2204 steps, run visited all 4 properties in 77 ms. (steps per millisecond=28 )
Probabilistic random walk after 2204 steps, saw 1070 distinct states, run finished after 84 ms. (steps per millisecond=26 ) properties seen :4
FORMULA MedleyA-PT-04-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA MedleyA-PT-04-UpperBounds-07 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 16739 ms.
ITS solved all properties within timeout

BK_STOP 1717352445489

--------------------
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-04"
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-04, 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-171734919400029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-04.tgz
mv MedleyA-PT-04 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 ;