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.r277-smll-171654416500014.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 itstools
Input is ParamProductionCell-PT-1, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r277-smll-171654416500014
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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 3.0K 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 20K Apr 12 20:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 20:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 20:33 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 1716762552639

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ParamProductionCell-PT-1
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202405141337
[2024-05-26 22:29:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-26 22:29:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:29:15] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2024-05-26 22:29:15] [INFO ] Transformed 231 places.
[2024-05-26 22:29:15] [INFO ] Transformed 202 transitions.
[2024-05-26 22:29:15] [INFO ] Found NUPN structural information;
[2024-05-26 22:29:15] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 454 ms.
Built sparse matrix representations for Structural reductions in 12 ms.19276KB 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 96 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 25 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2024-05-26 22:29:16] [INFO ] Computed 59 invariants in 44 ms
[2024-05-26 22:29:16] [INFO ] Implicit Places using invariants in 705 ms returned []
[2024-05-26 22:29:16] [INFO ] Invariant cache hit.
[2024-05-26 22:29:17] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-26 22:29:17] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
[2024-05-26 22:29:17] [INFO ] Redundant transitions in 15 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-26 22:29:17] [INFO ] Invariant cache hit.
[2024-05-26 22:29:17] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 34/263 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 23/286 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-26 22:29:20] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 63 ms to minimize.
[2024-05-26 22:29:20] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 4 ms to minimize.
[2024-05-26 22:29:20] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 3 ms to minimize.
[2024-05-26 22:29:20] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 3 ms to minimize.
[2024-05-26 22:29:20] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-26 22:29:20] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 3 ms to minimize.
[2024-05-26 22:29:20] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-26 22:29:21] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-05-26 22:29:21] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-05-26 22:29:21] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2024-05-26 22:29:21] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-26 22:29:21] [INFO ] Deduced a trap composed of 12 places in 329 ms of which 1 ms to minimize.
[2024-05-26 22:29:21] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-26 22:29:22] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-26 22:29:22] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-26 22:29:22] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-26 22:29:22] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 3 ms to minimize.
[2024-05-26 22:29:22] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 3 ms to minimize.
[2024-05-26 22:29:22] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-26 22:29:23] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 20/306 constraints. Problems are: Problem set: 6 solved, 195 unsolved
[2024-05-26 22:29:24] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-26 22:29:24] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 3 ms to minimize.
[2024-05-26 22:29:25] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 3 ms to minimize.
[2024-05-26 22:29:25] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 3 ms to minimize.
[2024-05-26 22:29:25] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 4 ms to minimize.
[2024-05-26 22:29:26] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 3 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
[2024-05-26 22:29:26] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 3 ms to minimize.
[2024-05-26 22:29:26] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 3 ms to minimize.
[2024-05-26 22:29:26] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 3 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
[2024-05-26 22:29:26] [INFO ] Deduced a trap composed of 83 places in 184 ms of which 6 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-05-26 22:29:26] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 3 ms to minimize.
[2024-05-26 22:29:27] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 3 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
[2024-05-26 22:29:27] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 3 ms to minimize.
[2024-05-26 22:29:27] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 4 ms to minimize.
[2024-05-26 22:29:28] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 6 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
[2024-05-26 22:29:28] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 4 ms to minimize.
Problem TDEAD149 is UNSAT
[2024-05-26 22:29:28] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 3 ms to minimize.
[2024-05-26 22:29:28] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-26 22:29:28] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 3 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
[2024-05-26 22:29:29] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 20/326 constraints. Problems are: Problem set: 30 solved, 171 unsolved
[2024-05-26 22:29:31] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-05-26 22:29:31] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 2 ms to minimize.
[2024-05-26 22:29:31] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 2 ms to minimize.
[2024-05-26 22:29:31] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-05-26 22:29:31] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 5/331 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/331 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 1/230 variables, 1/332 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 1/333 constraints. Problems are: Problem set: 30 solved, 171 unsolved
[2024-05-26 22:29:36] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-26 22:29:37] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-26 22:29:37] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
[2024-05-26 22:29:37] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 4/337 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/337 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 11 (OVERLAPS) 1/231 variables, 1/338 constraints. Problems are: Problem set: 30 solved, 171 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 1/339 constraints. Problems are: Problem set: 30 solved, 171 unsolved
[2024-05-26 22:29:43] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 4 ms to minimize.
[2024-05-26 22:29:43] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 5 ms to minimize.
[2024-05-26 22:29:44] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 3 ms to minimize.
[2024-05-26 22:29:44] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 3 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 4/343 constraints. Problems are: Problem set: 40 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 231/433 variables, and 343 constraints, problems are : Problem set: 40 solved, 161 unsolved in 30026 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: 201/201 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 40 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 205/205 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 28/233 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 16/249 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 27/276 constraints. Problems are: Problem set: 40 solved, 161 unsolved
[2024-05-26 22:29:48] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-26 22:29:49] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-26 22:29:49] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-26 22:29:49] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 4/280 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/280 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 25/230 variables, 7/287 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 25/312 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 7/319 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 23/342 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/342 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 11 (OVERLAPS) 1/231 variables, 1/343 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/231 variables, 1/344 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 3/347 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/231 variables, 0/347 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 15 (OVERLAPS) 202/433 variables, 231/578 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/433 variables, 68/646 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 161/807 constraints. Problems are: Problem set: 40 solved, 161 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 0/807 constraints. Problems are: Problem set: 40 solved, 161 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/433 variables, and 807 constraints, problems are : Problem set: 40 solved, 161 unsolved in 30018 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: 161/201 constraints, Known Traps: 57/57 constraints]
After SMT, in 60285ms problems are : Problem set: 40 solved, 161 unsolved
Search for dead transitions found 40 dead transitions in 60319ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 231/231 places, 162/202 transitions.
Computed a total of 24 stabilizing places and 0 stable transitions
Graph (complete) has 643 edges and 231 vertex of which 207 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.6 ms
Discarding 24 places :
Also discarding 0 output 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 1 rules in 33 ms. Remains 207 /231 variables (removed 24) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 207 cols
[2024-05-26 22:30:17] [INFO ] Computed 59 invariants in 7 ms
[2024-05-26 22:30:17] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-26 22:30:17] [INFO ] Invariant cache hit.
[2024-05-26 22:30:18] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-26 22:30:18] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 207/231 places, 162/202 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 62246 ms. Remains : 207/231 places, 162/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2032 ms (no deadlock found). (steps per millisecond=615 )
Random directed walk for 1250000 steps, including 0 resets, run took 1555 ms (no deadlock found). (steps per millisecond=803 )
[2024-05-26 22:30:21] [INFO ] Invariant cache hit.
[2024-05-26 22:30:22] [INFO ] [Real]Absence check using 35 positive place invariants in 49 ms returned sat
[2024-05-26 22:30:22] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 155 ms returned sat
[2024-05-26 22:30:23] [INFO ] [Real]Absence check using state equation in 1766 ms returned sat
[2024-05-26 22:30:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:30:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2024-05-26 22:30:24] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 29 ms returned sat
[2024-05-26 22:30:25] [INFO ] [Nat]Absence check using state equation in 1085 ms returned sat
[2024-05-26 22:30:25] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-26 22:30:25] [INFO ] [Nat]Added 48 Read/Feed constraints in 43 ms returned sat
[2024-05-26 22:30:25] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
[2024-05-26 22:30:25] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-05-26 22:30:25] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 4 ms to minimize.
[2024-05-26 22:30:26] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 6 ms to minimize.
[2024-05-26 22:30:26] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 3 ms to minimize.
[2024-05-26 22:30:26] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 3 ms to minimize.
[2024-05-26 22:30:26] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 4 ms to minimize.
[2024-05-26 22:30:26] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 3 ms to minimize.
[2024-05-26 22:30:26] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 3 ms to minimize.
[2024-05-26 22:30:27] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-26 22:30:27] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-26 22:30:27] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-26 22:30:27] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 3 ms to minimize.
[2024-05-26 22:30:27] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-05-26 22:30:27] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-26 22:30:27] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-05-26 22:30:28] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-26 22:30:28] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-26 22:30:28] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-26 22:30:28] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-26 22:30:29] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-05-26 22:30:29] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 3 ms to minimize.
[2024-05-26 22:30:29] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 3 ms to minimize.
[2024-05-26 22:30:29] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-26 22:30:29] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 3 ms to minimize.
[2024-05-26 22:30:29] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-26 22:30:30] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 3 ms to minimize.
[2024-05-26 22:30:30] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-26 22:30:30] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-05-26 22:30:30] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-26 22:30:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 30 trap constraints in 5262 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 2 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 56 ms. Remains 199 /231 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 199 cols
[2024-05-26 22:30:30] [INFO ] Computed 59 invariants in 5 ms
[2024-05-26 22:30:31] [INFO ] Implicit Places using invariants in 662 ms returned [1, 2, 9, 14, 15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 71, 77, 78, 80, 93, 94, 96, 98, 99, 122, 137, 138, 140, 142, 143, 166, 168, 169, 172, 173, 178, 179, 181, 190]
[2024-05-26 22:30:31] [INFO ] Actually due to overlaps returned [80, 78, 77, 14, 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 34 places :
Implicit Place search using SMT only with invariants took 666 ms to find 34 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 165/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 165 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 146 transition count 151
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 38 place count 146 transition count 143
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 54 place count 138 transition count 143
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 152 place count 89 transition count 94
Applied a total of 152 rules in 21 ms. Remains 89 /165 variables (removed 76) and now considering 94/170 (removed 76) transitions.
// Phase 1: matrix 94 rows 89 cols
[2024-05-26 22:30:31] [INFO ] Computed 25 invariants in 2 ms
[2024-05-26 22:30:31] [INFO ] Implicit Places using invariants in 247 ms returned [1, 2, 9, 14, 15, 22, 23, 32, 37, 42, 61, 76]
[2024-05-26 22:30:31] [INFO ] Actually due to overlaps returned [9, 42, 61, 1, 2, 14, 15, 22, 23, 37, 76]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 250 ms to find 11 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 78/231 places, 94/202 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 73 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 72 transition count 88
Applied a total of 12 rules in 8 ms. Remains 72 /78 variables (removed 6) and now considering 88/94 (removed 6) transitions.
// Phase 1: matrix 88 rows 72 cols
[2024-05-26 22:30:31] [INFO ] Computed 14 invariants in 2 ms
[2024-05-26 22:30:31] [INFO ] Implicit Places using invariants in 143 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 145 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 71/231 places, 88/202 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 87
Applied a total of 2 rules in 4 ms. Remains 70 /71 variables (removed 1) and now considering 87/88 (removed 1) transitions.
// Phase 1: matrix 87 rows 70 cols
[2024-05-26 22:30:31] [INFO ] Computed 13 invariants in 2 ms
[2024-05-26 22:30:31] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-26 22:30:31] [INFO ] Invariant cache hit.
[2024-05-26 22:30:32] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-26 22:30:32] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 4 : 70/231 places, 87/202 transitions.
Finished structural reductions in LIVENESS mode , in 4 iterations and 1662 ms. Remains : 70/231 places, 87/202 transitions.
Initial state reduction rules removed 1 formulas.
[2024-05-26 22:30:33] [INFO ] Flatten gal took : 123 ms
[2024-05-26 22:30:33] [INFO ] Flatten gal took : 59 ms
RANDOM walk for 40000 steps (8 resets) in 3888 ms. (10 steps per ms) remains 24/86 properties
[2024-05-26 22:30:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8963765192963109904.gal : 21 ms
BEST_FIRST walk for 4001 steps (8 resets) in 79 ms. (50 steps per ms) remains 24/24 properties
[2024-05-26 22:30:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16561763421045626040.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8963765192963109904.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16561763421045626040.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 4001 steps (8 resets) in 151 ms. (26 steps per ms) remains 24/24 properties
its-reach command run as :
BEST_FIRST walk for 4001 steps (8 resets) in 91 ms. (43 steps per ms) remains 24/24 properties

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16561763421045626040.prop.
BEST_FIRST walk for 4002 steps (8 resets) in 174 ms. (22 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :7 after 12
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :21 after 28
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :28 after 50
BEST_FIRST walk for 4001 steps (8 resets) in 116 ms. (34 steps per ms) remains 24/24 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,505,0.063992,4392,2,508,12,2161,30,0,411,1504,0
Total reachable state count : 505

Verifying 24 reachability properties.
Reachability property qltransition_11 does not hold.
ITS tools runner thread asked to quit. Dying gracefully.
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 48 ms. (81 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 78850 ms.

BK_STOP 1716762634043

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-1"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ParamProductionCell-PT-1, 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 r277-smll-171654416500014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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