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.r276-smll-171654415800019.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 ParamProductionCell-PT-2, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654415800019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 12 20:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 12 20:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716810651951

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 11:50:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-27 11:50:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 11:50:54] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2024-05-27 11:50:54] [INFO ] Transformed 231 places.
[2024-05-27 11:50:54] [INFO ] Transformed 202 transitions.
[2024-05-27 11:50:54] [INFO ] Found NUPN structural information;
[2024-05-27 11:50:54] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 398 ms.
Built sparse matrix representations for Structural reductions in 7 ms.19181KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 67 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 93 ms. Remains : 231/231 places, 202/202 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 14 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2024-05-27 11:50:55] [INFO ] Computed 59 invariants in 36 ms
[2024-05-27 11:50:55] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-05-27 11:50:55] [INFO ] Invariant cache hit.
[2024-05-27 11:50:55] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 11:50:55] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
[2024-05-27 11:50:55] [INFO ] Redundant transitions in 8 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-27 11:50:55] [INFO ] Invariant cache hit.
[2024-05-27 11:50:56] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 227/227 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 32/259 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 22/281 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-27 11:50:58] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 38 ms to minimize.
[2024-05-27 11:50:58] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 2 ms to minimize.
[2024-05-27 11:50:58] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-05-27 11:50:58] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 3 ms to minimize.
[2024-05-27 11:50:59] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-05-27 11:50:59] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 3 ms to minimize.
[2024-05-27 11:50:59] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-27 11:50:59] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-27 11:50:59] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-27 11:50:59] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 3 ms to minimize.
[2024-05-27 11:50:59] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 3 ms to minimize.
[2024-05-27 11:50:59] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2024-05-27 11:50:59] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-27 11:50:59] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 3 ms to minimize.
[2024-05-27 11:51:00] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 3 ms to minimize.
[2024-05-27 11:51:00] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-05-27 11:51:00] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-27 11:51:00] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-27 11:51:00] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-27 11:51:00] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-27 11:51:01] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-05-27 11:51:02] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-27 11:51:02] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 3 ms to minimize.
[2024-05-27 11:51:02] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
[2024-05-27 11:51:02] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-05-27 11:51:02] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 3 ms to minimize.
[2024-05-27 11:51:02] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-27 11:51:02] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-27 11:51:03] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-27 11:51:03] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-05-27 11:51:03] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-27 11:51:03] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 2 ms to minimize.
[2024-05-27 11:51:03] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-27 11:51:03] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-27 11:51:03] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 4 ms to minimize.
[2024-05-27 11:51:03] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-27 11:51:04] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 2 ms to minimize.
[2024-05-27 11:51:04] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-27 11:51:04] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 2 ms to minimize.
[2024-05-27 11:51:04] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-27 11:51:05] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-27 11:51:06] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2024-05-27 11:51:06] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 3 ms to minimize.
[2024-05-27 11:51:06] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-27 11:51:06] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-27 11:51:06] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 6/327 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-27 11:51:07] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-27 11:51:08] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-27 11:51:11] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 3/230 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-27 11:51:17] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-27 11:51:17] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 3 ms to minimize.
[2024-05-27 11:51:18] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 4 ms to minimize.
[2024-05-27 11:51:19] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-27 11:51:19] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
[2024-05-27 11:51:19] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 6/343 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 14 (OVERLAPS) 1/231 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 231/433 variables, and 345 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30034 ms.
Refiners :[Domain max(s): 231/231 constraints, Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/231 constraints, ReadFeed: 0/68 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 227/227 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 32/259 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 22/281 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 54/335 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 3/230 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 1/231 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-27 11:51:35] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 3 ms to minimize.
[2024-05-27 11:51:35] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 5 ms to minimize.
[2024-05-27 11:51:35] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 14 (OVERLAPS) 202/433 variables, 231/579 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/433 variables, 68/647 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/433 variables, 200/847 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/433 variables, and 847 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30029 ms.
Refiners :[Domain max(s): 231/231 constraints, Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 231/231 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 58/58 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61296 ms. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2260 ms (no deadlock found). (steps per millisecond=553 )
Random directed walk for 1250000 steps, including 0 resets, run took 1635 ms (no deadlock found). (steps per millisecond=764 )
[2024-05-27 11:52:00] [INFO ] Invariant cache hit.
[2024-05-27 11:52:00] [INFO ] [Real]Absence check using 35 positive place invariants in 44 ms returned sat
[2024-05-27 11:52:00] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 124 ms returned sat
[2024-05-27 11:52:02] [INFO ] [Real]Absence check using state equation in 1601 ms returned sat
[2024-05-27 11:52:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 11:52:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 23 ms returned sat
[2024-05-27 11:52:02] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 42 ms returned sat
[2024-05-27 11:52:03] [INFO ] [Nat]Absence check using state equation in 942 ms returned sat
[2024-05-27 11:52:03] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 11:52:03] [INFO ] [Nat]Added 68 Read/Feed constraints in 47 ms returned sat
[2024-05-27 11:52:03] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-27 11:52:03] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 3 ms to minimize.
[2024-05-27 11:52:03] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 3 ms to minimize.
[2024-05-27 11:52:03] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-27 11:52:03] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
[2024-05-27 11:52:04] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 3 ms to minimize.
[2024-05-27 11:52:04] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 3 ms to minimize.
[2024-05-27 11:52:04] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 3 ms to minimize.
[2024-05-27 11:52:04] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 3 ms to minimize.
[2024-05-27 11:52:04] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-27 11:52:05] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 4 ms to minimize.
[2024-05-27 11:52:05] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-05-27 11:52:05] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 3 ms to minimize.
[2024-05-27 11:52:05] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 3 ms to minimize.
[2024-05-27 11:52:05] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-05-27 11:52:06] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-27 11:52:06] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 3 ms to minimize.
[2024-05-27 11:52:06] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 5 ms to minimize.
[2024-05-27 11:52:06] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 3 ms to minimize.
[2024-05-27 11:52:07] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 4 ms to minimize.
[2024-05-27 11:52:07] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 3 ms to minimize.
[2024-05-27 11:52:07] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 3 ms to minimize.
[2024-05-27 11:52:07] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 4 ms to minimize.
[2024-05-27 11:52:07] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 3 ms to minimize.
[2024-05-27 11:52:08] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 4 ms to minimize.
[2024-05-27 11:52:08] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-27 11:52:08] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 3 ms to minimize.
[2024-05-27 11:52:08] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 4 ms to minimize.
[2024-05-27 11:52:08] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-27 11:52:09] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-27 11:52:09] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-27 11:52:09] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-05-27 11:52:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 32 trap constraints in 6183 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 64 place count 199 transition count 170
Applied a total of 64 rules in 40 ms. Remains 199 /231 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 199 cols
[2024-05-27 11:52:09] [INFO ] Computed 59 invariants in 10 ms
[2024-05-27 11:52:09] [INFO ] Implicit Places using invariants in 514 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 93, 94, 96, 98, 99, 137, 138, 140, 142, 143, 168, 169, 172, 173, 178, 179, 181, 190]
[2024-05-27 11:52:09] [INFO ] Actually due to overlaps returned [80, 78, 77, 35, 40, 54, 64, 93, 94, 96, 137, 138, 140, 172, 173, 181, 17, 18, 22, 28, 36, 41, 55, 65, 178, 179, 190, 98, 99, 142, 143, 168, 169]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 518 ms to find 33 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 166/231 places, 170/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 166 transition count 151
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 147 transition count 151
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 38 place count 147 transition count 147
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 143 transition count 147
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 144 place count 94 transition count 98
Applied a total of 144 rules in 13 ms. Remains 94 /166 variables (removed 72) and now considering 98/170 (removed 72) transitions.
// Phase 1: matrix 98 rows 94 cols
[2024-05-27 11:52:10] [INFO ] Computed 26 invariants in 2 ms
[2024-05-27 11:52:10] [INFO ] Implicit Places using invariants in 226 ms returned [15, 16, 23, 24, 33, 38]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 228 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 88/231 places, 98/202 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 84 transition count 94
Applied a total of 8 rules in 6 ms. Remains 84 /88 variables (removed 4) and now considering 94/98 (removed 4) transitions.
// Phase 1: matrix 94 rows 84 cols
[2024-05-27 11:52:10] [INFO ] Computed 20 invariants in 2 ms
[2024-05-27 11:52:10] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-27 11:52:10] [INFO ] Invariant cache hit.
[2024-05-27 11:52:10] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 11:52:10] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 84/231 places, 94/202 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 1376 ms. Remains : 84/231 places, 94/202 transitions.
Initial state reduction rules removed 2 formulas.
RANDOM walk for 20958 steps (4 resets) in 1411 ms. (14 steps per ms) remains 0/92 properties
Able to resolve query QuasiLiveness after proving 94 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 64 place count 199 transition count 170
Applied a total of 64 rules in 15 ms. Remains 199 /231 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 199 cols
[2024-05-27 11:52:11] [INFO ] Computed 59 invariants in 4 ms
[2024-05-27 11:52:11] [INFO ] Implicit Places using invariants in 398 ms returned [15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 77, 78, 80, 93, 94, 96, 98, 99, 137, 138, 140, 142, 143, 168, 169, 172, 173, 178, 179, 181, 190]
[2024-05-27 11:52:11] [INFO ] Actually due to overlaps returned [80, 78, 77, 35, 40, 54, 64, 93, 94, 96, 137, 138, 140, 172, 173, 181, 17, 18, 22, 28, 36, 41, 55, 65, 178, 179, 190, 98, 99, 142, 143, 168, 169]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 407 ms to find 33 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 166/231 places, 170/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 166 transition count 151
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 147 transition count 151
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 38 place count 147 transition count 147
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 143 transition count 147
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 144 place count 94 transition count 98
Applied a total of 144 rules in 15 ms. Remains 94 /166 variables (removed 72) and now considering 98/170 (removed 72) transitions.
// Phase 1: matrix 98 rows 94 cols
[2024-05-27 11:52:11] [INFO ] Computed 26 invariants in 1 ms
[2024-05-27 11:52:12] [INFO ] Implicit Places using invariants in 179 ms returned [15, 16, 23, 24, 33, 38]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 181 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 88/231 places, 98/202 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 84 transition count 94
Applied a total of 8 rules in 5 ms. Remains 84 /88 variables (removed 4) and now considering 94/98 (removed 4) transitions.
// Phase 1: matrix 94 rows 84 cols
[2024-05-27 11:52:12] [INFO ] Computed 20 invariants in 2 ms
[2024-05-27 11:52:12] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-27 11:52:12] [INFO ] Invariant cache hit.
[2024-05-27 11:52:12] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 11:52:12] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 84/231 places, 94/202 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 1088 ms. Remains : 84/231 places, 94/202 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :94 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 94 properties from file /home/mcc/execution/Liveness.xml in 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 78274 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ParamProductionCell-PT-2

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 231
TRANSITIONS: 202
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 846
NUPN UNITS: 38
LOADING TIME: 0.86

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.048
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.329
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 854
MODEL NAME: /home/mcc/execution/model
231 places, 202 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

--------------------
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 Liveness -timeout 180 -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="ParamProductionCell-PT-2"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ParamProductionCell-PT-2, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r276-smll-171654415800019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-2.tgz
mv ParamProductionCell-PT-2 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;