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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.2K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 20:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 12 20:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 1716812546213

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-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 12:22:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-27 12:22:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 12:22:29] [INFO ] Load time of PNML (sax parser for PT used): 279 ms
[2024-05-27 12:22:29] [INFO ] Transformed 231 places.
[2024-05-27 12:22:29] [INFO ] Transformed 202 transitions.
[2024-05-27 12:22:29] [INFO ] Found NUPN structural information;
[2024-05-27 12:22:29] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 625 ms.
Built sparse matrix representations for Structural reductions in 12 ms.19004KB 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 59 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 92 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 52 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 12:22:29] [INFO ] Computed 59 invariants in 34 ms
[2024-05-27 12:22:30] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-27 12:22:30] [INFO ] Invariant cache hit.
[2024-05-27 12:22:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 12:22:30] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2024-05-27 12:22:30] [INFO ] Redundant transitions in 16 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-27 12:22:30] [INFO ] Invariant cache hit.
[2024-05-27 12:22:30] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 28/251 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 22/273 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-27 12:22:33] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 27 ms to minimize.
[2024-05-27 12:22:33] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 4 ms to minimize.
[2024-05-27 12:22:33] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 2 ms to minimize.
[2024-05-27 12:22:34] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-05-27 12:22:34] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-27 12:22:34] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-27 12:22:34] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-27 12:22:34] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
[2024-05-27 12:22:34] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
[2024-05-27 12:22:34] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-27 12:22:35] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-27 12:22:35] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-05-27 12:22:35] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
[2024-05-27 12:22:35] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-27 12:22:35] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
[2024-05-27 12:22:35] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 2 ms to minimize.
[2024-05-27 12:22:35] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 2 ms to minimize.
[2024-05-27 12:22:35] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-27 12:22:35] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 5 ms to minimize.
[2024-05-27 12:22:35] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-27 12:22:38] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 3 ms to minimize.
[2024-05-27 12:22:38] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 3 ms to minimize.
[2024-05-27 12:22:38] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-27 12:22:38] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-27 12:22:39] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-27 12:22:39] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-27 12:22:39] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 7/300 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-27 12:22:40] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-05-27 12:22:41] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-27 12:22:43] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-27 12:22:44] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 7/230 variables, 7/311 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 7/318 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-27 12:22:50] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 3 ms to minimize.
[2024-05-27 12:22:50] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 3 ms to minimize.
[2024-05-27 12:22:50] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 2 ms to minimize.
[2024-05-27 12:22:50] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 10 ms to minimize.
[2024-05-27 12:22:50] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 4 ms to minimize.
[2024-05-27 12:22:50] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-27 12:22:50] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-27 12:22:50] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-05-27 12:22:50] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 3 ms to minimize.
[2024-05-27 12:22:51] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2024-05-27 12:22:51] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-05-27 12:22:51] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-27 12:22:51] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 2 ms to minimize.
[2024-05-27 12:22:51] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
[2024-05-27 12:22:51] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
[2024-05-27 12:22:51] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
[2024-05-27 12:22:51] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 3 ms to minimize.
[2024-05-27 12:22:53] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-27 12:22:53] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-27 12:22:53] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 20/339 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-27 12:22:55] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 14 (OVERLAPS) 1/231 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 231/433 variables, and 342 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30036 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: 198/198 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 223/223 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 28/251 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 22/273 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 43/316 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 7/230 variables, 7/323 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 7/330 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 9/340 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-27 12:23:05] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 3 ms to minimize.
[2024-05-27 12:23:05] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 3 ms to minimize.
[2024-05-27 12:23:05] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-27 12:23:06] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-27 12:23:08] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (OVERLAPS) 1/231 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-27 12:23:13] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 3 ms to minimize.
[2024-05-27 12:23:14] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/231 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 16 (OVERLAPS) 202/433 variables, 231/580 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 68/648 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 198/846 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/433 variables, and 846 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30013 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: 198/198 constraints, Known Traps: 59/59 constraints]
After SMT, in 60268ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 60308ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61553 ms. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2078 ms (no deadlock found). (steps per millisecond=601 )
Random directed walk for 1250000 steps, including 0 resets, run took 1670 ms (no deadlock found). (steps per millisecond=748 )
[2024-05-27 12:23:34] [INFO ] Invariant cache hit.
[2024-05-27 12:23:35] [INFO ] [Real]Absence check using 35 positive place invariants in 40 ms returned sat
[2024-05-27 12:23:35] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 119 ms returned sat
[2024-05-27 12:23:36] [INFO ] [Real]Absence check using state equation in 1118 ms returned sat
[2024-05-27 12:23:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 12:23:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2024-05-27 12:23:36] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 52 ms returned sat
[2024-05-27 12:23:37] [INFO ] [Nat]Absence check using state equation in 1139 ms returned sat
[2024-05-27 12:23:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 12:23:37] [INFO ] [Nat]Added 68 Read/Feed constraints in 57 ms returned sat
[2024-05-27 12:23:37] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-27 12:23:37] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-05-27 12:23:38] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 4 ms to minimize.
[2024-05-27 12:23:38] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 3 ms to minimize.
[2024-05-27 12:23:38] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 4 ms to minimize.
[2024-05-27 12:23:38] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-27 12:23:38] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-27 12:23:38] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-27 12:23:39] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 3 ms to minimize.
[2024-05-27 12:23:39] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-27 12:23:39] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 3 ms to minimize.
[2024-05-27 12:23:39] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-27 12:23:39] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
[2024-05-27 12:23:39] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-27 12:23:40] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-05-27 12:23:40] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2024-05-27 12:23:40] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-27 12:23:40] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-27 12:23:40] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-27 12:23:40] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-27 12:23:40] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 2 ms to minimize.
[2024-05-27 12:23:41] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-27 12:23:41] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-27 12:23:41] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-27 12:23:41] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-05-27 12:23:41] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 3 ms to minimize.
[2024-05-27 12:23:41] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 3 ms to minimize.
[2024-05-27 12:23:42] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-05-27 12:23:42] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 3 ms to minimize.
[2024-05-27 12:23:42] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2024-05-27 12:23:42] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 3 ms to minimize.
[2024-05-27 12:23:42] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 3 ms to minimize.
[2024-05-27 12:23:42] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 3 ms to minimize.
[2024-05-27 12:23:43] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 3 ms to minimize.
[2024-05-27 12:23:43] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 3 ms to minimize.
[2024-05-27 12:23:43] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 3 ms to minimize.
[2024-05-27 12:23:43] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 3 ms to minimize.
[2024-05-27 12:23:43] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-05-27 12:23:43] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 3 ms to minimize.
[2024-05-27 12:23:44] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2024-05-27 12:23:44] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 3 ms to minimize.
[2024-05-27 12:23:44] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
[2024-05-27 12:23:44] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 4 ms to minimize.
[2024-05-27 12:23:44] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 3 ms to minimize.
[2024-05-27 12:23:45] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 3 ms to minimize.
[2024-05-27 12:23:45] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 3 ms to minimize.
[2024-05-27 12:23:45] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-27 12:23:45] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-27 12:23:45] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 3 ms to minimize.
[2024-05-27 12:23:46] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 3 ms to minimize.
[2024-05-27 12:23:46] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-27 12:23:46] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 3 ms to minimize.
[2024-05-27 12:23:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 52 trap constraints in 9148 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 3 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 2 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 66 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 12:23:46] [INFO ] Computed 59 invariants in 8 ms
[2024-05-27 12:23:47] [INFO ] Implicit Places using invariants in 727 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 12:23:47] [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 732 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 19 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 12:23:47] [INFO ] Computed 26 invariants in 3 ms
[2024-05-27 12:23:47] [INFO ] Implicit Places using invariants in 220 ms returned [15, 16, 23, 24, 33, 38]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 222 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 88/231 places, 98/202 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 86 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 84 transition count 94
Applied a total of 8 rules in 11 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 12:23:47] [INFO ] Computed 20 invariants in 5 ms
[2024-05-27 12:23:48] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-27 12:23:48] [INFO ] Invariant cache hit.
[2024-05-27 12:23:48] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 12:23:48] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 533 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 1584 ms. Remains : 84/231 places, 94/202 transitions.
Initial state reduction rules removed 3 formulas.
RANDOM walk for 7492 steps (1 resets) in 723 ms. (10 steps per ms) remains 0/91 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 0 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 10 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 12:23:48] [INFO ] Computed 59 invariants in 7 ms
[2024-05-27 12:23:49] [INFO ] Implicit Places using invariants in 459 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 12:23:49] [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 462 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 0 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 9 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 12:23:49] [INFO ] Computed 26 invariants in 1 ms
[2024-05-27 12:23:49] [INFO ] Implicit Places using invariants in 146 ms returned [15, 16, 23, 24, 33, 38]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 148 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 88/231 places, 98/202 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 86 transition count 96
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 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 12:23:49] [INFO ] Computed 20 invariants in 1 ms
[2024-05-27 12:23:49] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-27 12:23:49] [INFO ] Invariant cache hit.
[2024-05-27 12:23:49] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 12:23:49] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 444 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 1082 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 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 81269 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ParamProductionCell-PT-4

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.614

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.037
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.975
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: 928
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-4"
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-4, 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-171654415800029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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