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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 12 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 15:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 185K May 18 16:42 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 1716224173011

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202405141337
[2024-05-20 16:56: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-20 16:56:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 16:56:15] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2024-05-20 16:56:15] [INFO ] Transformed 161 places.
[2024-05-20 16:56:15] [INFO ] Transformed 365 transitions.
[2024-05-20 16:56:15] [INFO ] Found NUPN structural information;
[2024-05-20 16:56:15] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 346 ms.
Built sparse matrix representations for Structural reductions in 9 ms.21284KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 161/161 places, 365/365 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 56 ms. Remains 161 /161 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 80 ms. Remains : 161/161 places, 365/365 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 161/161 places, 365/365 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 161 /161 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 161 cols
[2024-05-20 16:56:15] [INFO ] Computed 13 invariants in 22 ms
[2024-05-20 16:56:16] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-20 16:56:16] [INFO ] Invariant cache hit.
[2024-05-20 16:56:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-20 16:56:16] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
[2024-05-20 16:56:16] [INFO ] Redundant transitions in 33 ms returned []
Running 360 sub problems to find dead transitions.
[2024-05-20 16:56:16] [INFO ] Invariant cache hit.
[2024-05-20 16:56:16] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-20 16:56:21] [INFO ] Deduced a trap composed of 84 places in 264 ms of which 37 ms to minimize.
[2024-05-20 16:56:21] [INFO ] Deduced a trap composed of 97 places in 204 ms of which 3 ms to minimize.
[2024-05-20 16:56:21] [INFO ] Deduced a trap composed of 68 places in 181 ms of which 3 ms to minimize.
[2024-05-20 16:56:21] [INFO ] Deduced a trap composed of 93 places in 210 ms of which 3 ms to minimize.
[2024-05-20 16:56:22] [INFO ] Deduced a trap composed of 93 places in 226 ms of which 4 ms to minimize.
[2024-05-20 16:56:22] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 3 ms to minimize.
[2024-05-20 16:56:22] [INFO ] Deduced a trap composed of 62 places in 179 ms of which 3 ms to minimize.
[2024-05-20 16:56:22] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 2 ms to minimize.
[2024-05-20 16:56:22] [INFO ] Deduced a trap composed of 83 places in 158 ms of which 10 ms to minimize.
[2024-05-20 16:56:23] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 2 ms to minimize.
[2024-05-20 16:56:23] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2024-05-20 16:56:23] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 2 ms to minimize.
[2024-05-20 16:56:23] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 2 ms to minimize.
[2024-05-20 16:56:23] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 3 ms to minimize.
[2024-05-20 16:56:23] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 2 ms to minimize.
[2024-05-20 16:56:24] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 2 ms to minimize.
[2024-05-20 16:56:24] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 2 ms to minimize.
[2024-05-20 16:56:24] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-20 16:56:24] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 2 ms to minimize.
[2024-05-20 16:56:24] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-20 16:56:27] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2024-05-20 16:56:27] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-20 16:56:27] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-20 16:56:28] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 2 ms to minimize.
[2024-05-20 16:56:28] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-05-20 16:56:28] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-20 16:56:28] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-20 16:56:28] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-20 16:56:28] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 2 ms to minimize.
[2024-05-20 16:56:28] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-20 16:56:28] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 2 ms to minimize.
[2024-05-20 16:56:29] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 2 ms to minimize.
[2024-05-20 16:56:29] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-20 16:56:29] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 2 ms to minimize.
[2024-05-20 16:56:29] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 6 ms to minimize.
[2024-05-20 16:56:29] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-05-20 16:56:30] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-05-20 16:56:30] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 2 ms to minimize.
[2024-05-20 16:56:30] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 3 ms to minimize.
[2024-05-20 16:56:30] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-20 16:56:31] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-20 16:56:31] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-05-20 16:56:31] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2024-05-20 16:56:32] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 1 ms to minimize.
[2024-05-20 16:56:32] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 2 ms to minimize.
[2024-05-20 16:56:32] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-05-20 16:56:32] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 2 ms to minimize.
[2024-05-20 16:56:32] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 2 ms to minimize.
[2024-05-20 16:56:33] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 2 ms to minimize.
[2024-05-20 16:56:33] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-05-20 16:56:33] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-05-20 16:56:33] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-20 16:56:33] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 2 ms to minimize.
[2024-05-20 16:56:33] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-05-20 16:56:33] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-05-20 16:56:33] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 7 ms to minimize.
[2024-05-20 16:56:34] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-05-20 16:56:34] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2024-05-20 16:56:34] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 3 ms to minimize.
[2024-05-20 16:56:34] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-20 16:56:36] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 2 ms to minimize.
[2024-05-20 16:56:36] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
[2024-05-20 16:56:36] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 1 ms to minimize.
[2024-05-20 16:56:36] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 3 ms to minimize.
[2024-05-20 16:56:36] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-05-20 16:56:36] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2024-05-20 16:56:37] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2024-05-20 16:56:37] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 2 ms to minimize.
[2024-05-20 16:56:37] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 2 ms to minimize.
[2024-05-20 16:56:37] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2024-05-20 16:56:37] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 2 ms to minimize.
[2024-05-20 16:56:37] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-20 16:56:38] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 2 ms to minimize.
[2024-05-20 16:56:38] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 2 ms to minimize.
[2024-05-20 16:56:38] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 2 ms to minimize.
[2024-05-20 16:56:38] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2024-05-20 16:56:38] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-05-20 16:56:39] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
[2024-05-20 16:56:39] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-20 16:56:39] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-20 16:56:43] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
[2024-05-20 16:56:43] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-05-20 16:56:43] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 3 ms to minimize.
[2024-05-20 16:56:43] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 2 ms to minimize.
[2024-05-20 16:56:44] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-20 16:56:44] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-20 16:56:44] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-20 16:56:44] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 3 ms to minimize.
[2024-05-20 16:56:45] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 2 ms to minimize.
[2024-05-20 16:56:45] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 3 ms to minimize.
[2024-05-20 16:56:45] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 2 ms to minimize.
[2024-05-20 16:56:45] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 3 ms to minimize.
[2024-05-20 16:56:45] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 3 ms to minimize.
[2024-05-20 16:56:46] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2024-05-20 16:56:46] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 3 ms to minimize.
[2024-05-20 16:56:46] [INFO ] Deduced a trap composed of 67 places in 170 ms of which 3 ms to minimize.
[2024-05-20 16:56:46] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 3 ms to minimize.
[2024-05-20 16:56:46] [INFO ] Deduced a trap composed of 97 places in 174 ms of which 3 ms to minimize.
[2024-05-20 16:56:47] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 3 ms to minimize.
[2024-05-20 16:56:47] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 161/526 variables, and 274 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30035 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/161 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 100/274 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-20 16:56:50] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 3 ms to minimize.
[2024-05-20 16:56:50] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 2 ms to minimize.
[2024-05-20 16:56:50] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 2 ms to minimize.
[2024-05-20 16:56:50] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 2 ms to minimize.
[2024-05-20 16:56:51] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 3 ms to minimize.
[2024-05-20 16:56:51] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 3 ms to minimize.
[2024-05-20 16:56:51] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 2 ms to minimize.
[2024-05-20 16:56:52] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-05-20 16:56:52] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 2 ms to minimize.
[2024-05-20 16:56:52] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 3 ms to minimize.
[2024-05-20 16:56:52] [INFO ] Deduced a trap composed of 111 places in 166 ms of which 3 ms to minimize.
[2024-05-20 16:56:53] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 3 ms to minimize.
[2024-05-20 16:56:53] [INFO ] Deduced a trap composed of 81 places in 195 ms of which 3 ms to minimize.
[2024-05-20 16:56:53] [INFO ] Deduced a trap composed of 75 places in 170 ms of which 2 ms to minimize.
[2024-05-20 16:56:53] [INFO ] Deduced a trap composed of 79 places in 160 ms of which 3 ms to minimize.
[2024-05-20 16:56:53] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 3 ms to minimize.
[2024-05-20 16:56:54] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 3 ms to minimize.
[2024-05-20 16:56:54] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 5 ms to minimize.
[2024-05-20 16:56:54] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 3 ms to minimize.
[2024-05-20 16:56:54] [INFO ] Deduced a trap composed of 92 places in 193 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-20 16:56:57] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2024-05-20 16:56:57] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 3 ms to minimize.
[2024-05-20 16:56:58] [INFO ] Deduced a trap composed of 115 places in 207 ms of which 3 ms to minimize.
[2024-05-20 16:56:58] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-20 16:56:58] [INFO ] Deduced a trap composed of 80 places in 206 ms of which 3 ms to minimize.
[2024-05-20 16:56:58] [INFO ] Deduced a trap composed of 55 places in 196 ms of which 3 ms to minimize.
[2024-05-20 16:56:58] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 3 ms to minimize.
[2024-05-20 16:56:59] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 2 ms to minimize.
[2024-05-20 16:56:59] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 3 ms to minimize.
[2024-05-20 16:56:59] [INFO ] Deduced a trap composed of 63 places in 170 ms of which 3 ms to minimize.
[2024-05-20 16:56:59] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 3 ms to minimize.
[2024-05-20 16:57:00] [INFO ] Deduced a trap composed of 107 places in 221 ms of which 3 ms to minimize.
[2024-05-20 16:57:00] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-20 16:57:00] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 1 ms to minimize.
[2024-05-20 16:57:00] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 3 ms to minimize.
[2024-05-20 16:57:03] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-05-20 16:57:03] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-05-20 16:57:03] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 2 ms to minimize.
[2024-05-20 16:57:04] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 3 ms to minimize.
[2024-05-20 16:57:04] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-20 16:57:10] [INFO ] Deduced a trap composed of 89 places in 208 ms of which 3 ms to minimize.
[2024-05-20 16:57:10] [INFO ] Deduced a trap composed of 78 places in 169 ms of which 3 ms to minimize.
[2024-05-20 16:57:10] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 3 ms to minimize.
[2024-05-20 16:57:12] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 3 ms to minimize.
[2024-05-20 16:57:13] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 3 ms to minimize.
[2024-05-20 16:57:13] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-05-20 16:57:13] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 2 ms to minimize.
[2024-05-20 16:57:13] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 2 ms to minimize.
[2024-05-20 16:57:14] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 2 ms to minimize.
[2024-05-20 16:57:14] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-05-20 16:57:14] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 3 ms to minimize.
[2024-05-20 16:57:14] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 2 ms to minimize.
[2024-05-20 16:57:15] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 3 ms to minimize.
[2024-05-20 16:57:16] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 3 ms to minimize.
[2024-05-20 16:57:17] [INFO ] Deduced a trap composed of 59 places in 217 ms of which 3 ms to minimize.
[2024-05-20 16:57:17] [INFO ] Deduced a trap composed of 90 places in 214 ms of which 3 ms to minimize.
[2024-05-20 16:57:17] [INFO ] Deduced a trap composed of 85 places in 178 ms of which 3 ms to minimize.
[2024-05-20 16:57:17] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 3 ms to minimize.
SMT process timed out in 61036ms, After SMT, problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 61074ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 62082 ms. Remains : 161/161 places, 365/365 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1927 ms (no deadlock found). (steps per millisecond=648 )
Random directed walk for 1250000 steps, including 0 resets, run took 1334 ms (no deadlock found). (steps per millisecond=937 )
[2024-05-20 16:57:21] [INFO ] Invariant cache hit.
[2024-05-20 16:57:21] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-20 16:57:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 144 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 161/161 places, 365/365 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 161 transition count 345
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 141 transition count 345
Applied a total of 40 rules in 40 ms. Remains 141 /161 variables (removed 20) and now considering 345/365 (removed 20) transitions.
// Phase 1: matrix 345 rows 141 cols
[2024-05-20 16:57:21] [INFO ] Computed 13 invariants in 11 ms
[2024-05-20 16:57:21] [INFO ] Implicit Places using invariants in 505 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 511 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 140/161 places, 345/365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 320
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 115 transition count 320
Applied a total of 50 rules in 10 ms. Remains 115 /140 variables (removed 25) and now considering 320/345 (removed 25) transitions.
// Phase 1: matrix 320 rows 115 cols
[2024-05-20 16:57:21] [INFO ] Computed 12 invariants in 6 ms
[2024-05-20 16:57:22] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-20 16:57:22] [INFO ] Invariant cache hit.
[2024-05-20 16:57:22] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-20 16:57:23] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 115/161 places, 320/365 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1691 ms. Remains : 115/161 places, 320/365 transitions.
Initial state reduction rules removed 5 formulas.
[2024-05-20 16:57:24] [INFO ] Flatten gal took : 205 ms
[2024-05-20 16:57:24] [INFO ] Flatten gal took : 117 ms
[2024-05-20 16:57:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2030540853009289824.gal : 43 ms
[2024-05-20 16:57:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8843211735863460531.prop : 6 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/ReachabilityCardinality2030540853009289824.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8843211735863460531.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8843211735863460531.prop.
RANDOM walk for 40000 steps (8 resets) in 4392 ms. (9 steps per ms) remains 22/315 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 20/22 properties
Reachability property qltransition_282 is true.
Reachability property qltransition_280 is true.
Reachability property qltransition_255 is true.
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 19/20 properties
Reachability property qltransition_182 is true.
Reachability property qltransition_181 is true.
Reachability property qltransition_137 is true.
Reachability property qltransition_136 is true.
Reachability property qltransition_92 is true.
Reachability property qltransition_91 is true.
Reachability property qltransition_47 is true.
Reachability property qltransition_46 is true.
Reachability property qltransition_1 is true.
SDD proceeding with computation,303 properties remain. new max is 2
SDD size :1 after 5
Reachability property qltransition_256 is true.
SDD proceeding with computation,302 properties remain. new max is 2
SDD size :5 after 6
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 19/19 properties
Reachability property qltransition_290 is true.
Reachability property qltransition_288 is true.
Reachability property qltransition_261 is true.
Reachability property qltransition_183 is true.
Reachability property qltransition_138 is true.
Reachability property qltransition_93 is true.
Reachability property qltransition_2 is true.
SDD proceeding with computation,295 properties remain. new max is 2
SDD size :6 after 13
Reachability property qltransition_260 is true.
SDD proceeding with computation,294 properties remain. new max is 2
SDD size :13 after 18
Reachability property qltransition_298 is true.
Reachability property qltransition_296 is true.
Reachability property qltransition_184 is true.
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 19/19 properties
Reachability property qltransition_139 is true.
Reachability property qltransition_48 is true.
Reachability property qltransition_3 is true.
SDD proceeding with computation,288 properties remain. new max is 2
SDD size :18 after 40
Reachability property qltransition_266 is true.
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/19 properties
SDD proceeding with computation,287 properties remain. new max is 2
SDD size :40 after 41
Reachability property qltransition_265 is true.
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/17 properties
SDD proceeding with computation,286 properties remain. new max is 2
SDD size :41 after 46
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 14/16 properties
SDD proceeding with computation,286 properties remain. new max is 4
SDD size :46 after 62
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 13/14 properties
Reachability property qltransition_306 is true.
Reachability property qltransition_304 is true.
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 11/13 properties
Reachability property qltransition_94 is true.
Reachability property qltransition_49 is true.
Reachability property qltransition_4 is true.
SDD proceeding with computation,281 properties remain. new max is 4
SDD size :62 after 130
Reachability property qltransition_271 is true.
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 9/11 properties
SDD proceeding with computation,280 properties remain. new max is 4
SDD size :130 after 137
Reachability property qltransition_270 is true.
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 8/9 properties
SDD proceeding with computation,279 properties remain. new max is 4
SDD size :137 after 156
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 6/8 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 5/6 properties
SDD proceeding with computation,279 properties remain. new max is 8
SDD size :156 after 196
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 5/5 properties
[2024-05-20 16:57:24] [INFO ] Invariant cache hit.
[2024-05-20 16:57:24] [INFO ] State equation strengthened by 35 read => feed constraints.
Reachability property qltransition_314 is true.
Reachability property qltransition_312 is true.
SDD proceeding with computation,277 properties remain. new max is 8
SDD size :196 after 324
SDD proceeding with computation,277 properties remain. new max is 16
SDD size :324 after 368
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property qltransition_276 is true.
Reachability property qltransition_275 is true.
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,275 properties remain. new max is 16
SDD size :368 after 414
At refinement iteration 2 (OVERLAPS) 55/61 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 55/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,275 properties remain. new max is 32
SDD size :414 after 548
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property qltransition_245 is true.
Reachability property qltransition_240 is true.
Reachability property qltransition_235 is true.
Reachability property qltransition_230 is true.
Reachability property qltransition_225 is true.
At refinement iteration 5 (OVERLAPS) 43/104 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property qltransition_185 is true.
Reachability property qltransition_140 is true.
Reachability property qltransition_95 is true.
Reachability property qltransition_50 is true.
Reachability property qltransition_5 is true.
SDD proceeding with computation,265 properties remain. new max is 32
SDD size :548 after 1182
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 43/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,265 properties remain. new max is 64
SDD size :1182 after 1326
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 11/115 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,265 properties remain. new max is 128
SDD size :1326 after 1494
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 11/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property qltransition_316 is true.
Reachability property qltransition_308 is true.
Reachability property qltransition_300 is true.
Reachability property qltransition_292 is true.
Reachability property qltransition_284 is true.
Reachability property qltransition_194 is true.
Reachability property qltransition_193 is true.
Reachability property qltransition_192 is true.
Reachability property qltransition_191 is true.
Reachability property qltransition_190 is true.
Reachability property qltransition_189 is true.
Reachability property qltransition_149 is true.
Reachability property qltransition_148 is true.
Reachability property qltransition_147 is true.
Reachability property qltransition_146 is true.
Reachability property qltransition_145 is true.
Reachability property qltransition_144 is true.
Reachability property qltransition_104 is true.
Reachability property qltransition_103 is true.
Reachability property qltransition_102 is true.
Reachability property qltransition_101 is true.
Reachability property qltransition_100 is true.
Reachability property qltransition_99 is true.
Reachability property qltransition_59 is true.
Reachability property qltransition_58 is true.
Reachability property qltransition_57 is true.
Reachability property qltransition_56 is true.
Reachability property qltransition_55 is true.
Reachability property qltransition_54 is true.
Reachability property qltransition_14 is true.
Reachability property qltransition_13 is true.
Reachability property qltransition_12 is true.
Reachability property qltransition_11 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_9 is true.
SDD proceeding with computation,230 properties remain. new max is 128
SDD size :1494 after 2342
[2024-05-20 16:57:25] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 2 ms to minimize.
SDD proceeding with computation,230 properties remain. new max is 256
SDD size :2342 after 2542
[2024-05-20 16:57:25] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property qltransition_246 is true.
Reachability property qltransition_241 is true.
Reachability property qltransition_236 is true.
Reachability property qltransition_231 is true.
Reachability property qltransition_226 is true.
Reachability property qltransition_195 is true.
Reachability property qltransition_186 is true.
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property qltransition_150 is true.
Reachability property qltransition_141 is true.
Reachability property qltransition_105 is true.
Reachability property qltransition_96 is true.
Reachability property qltransition_60 is true.
Reachability property qltransition_51 is true.
Reachability property qltransition_15 is true.
Reachability property qltransition_6 is true.
SDD proceeding with computation,215 properties remain. new max is 256
SDD size :2542 after 3648
At refinement iteration 12 (OVERLAPS) 320/435 variables, 115/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 35/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/435 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 279 constraints, problems are : Problem set: 0 solved, 5 unsolved in 951 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 55/61 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 55/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property qltransition_318 is true.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 43/104 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 43/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property qltransition_310 is true.
At refinement iteration 8 (OVERLAPS) 11/115 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 11/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property qltransition_302 is true.
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property qltransition_294 is true.
Reachability property qltransition_286 is true.
Reachability property qltransition_277 is true.
Reachability property qltransition_272 is true.
Reachability property qltransition_267 is true.
Reachability property qltransition_262 is true.
Reachability property qltransition_257 is true.
Reachability property qltransition_247 is true.
Reachability property qltransition_242 is true.
Reachability property qltransition_237 is true.
Reachability property qltransition_232 is true.
Reachability property qltransition_227 is true.
Reachability property qltransition_205 is true.
Reachability property qltransition_204 is true.
Reachability property qltransition_203 is true.
Reachability property qltransition_202 is true.
Reachability property qltransition_201 is true.
Reachability property qltransition_200 is true.
Reachability property qltransition_199 is true.
Reachability property qltransition_198 is true.
At refinement iteration 12 (OVERLAPS) 320/435 variables, 115/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property qltransition_160 is true.
Reachability property qltransition_159 is true.
Reachability property qltransition_158 is true.
Reachability property qltransition_157 is true.
Reachability property qltransition_156 is true.
Reachability property qltransition_155 is true.
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 35/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property qltransition_154 is true.
Reachability property qltransition_153 is true.
Reachability property qltransition_115 is true.
Reachability property qltransition_114 is true.
Reachability property qltransition_113 is true.
Reachability property qltransition_112 is true.
Reachability property qltransition_111 is true.
Reachability property qltransition_110 is true.
Reachability property qltransition_109 is true.
Reachability property qltransition_108 is true.
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property qltransition_70 is true.
Reachability property qltransition_69 is true.
Reachability property qltransition_68 is true.
Reachability property qltransition_67 is true.
Reachability property qltransition_66 is true.
Reachability property qltransition_65 is true.
Reachability property qltransition_64 is true.
Reachability property qltransition_63 is true.
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Reachability property qltransition_25 is true.
Reachability property qltransition_24 is true.
Reachability property qltransition_23 is true.
Reachability property qltransition_22 is true.
Reachability property qltransition_21 is true.
Reachability property qltransition_20 is true.
Reachability property qltransition_19 is true.
Reachability property qltransition_18 is true.
SDD proceeding with computation,160 properties remain. new max is 256
SDD size :3648 after 7466
At refinement iteration 16 (OVERLAPS) 0/435 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
SDD proceeding with computation,160 properties remain. new max is 512
SDD size :7466 after 7774
After SMT solving in domain Int declared 435/435 variables, and 284 constraints, problems are : Problem set: 0 solved, 5 unsolved in 767 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 1749ms problems are : Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,160 properties remain. new max is 1024
SDD size :7774 after 8331
Reachability property qltransition_258 is true.
Reachability property qltransition_254 is true.
Reachability property qltransition_253 is true.
Reachability property qltransition_252 is true.
Reachability property qltransition_251 is true.
Reachability property qltransition_250 is true.
Reachability property qltransition_248 is true.
Reachability property qltransition_243 is true.
Reachability property qltransition_238 is true.
Reachability property qltransition_233 is true.
Reachability property qltransition_228 is true.
Reachability property qltransition_196 is true.
Reachability property qltransition_187 is true.
Reachability property qltransition_151 is true.
Reachability property qltransition_142 is true.
Reachability property qltransition_106 is true.
Reachability property qltransition_97 is true.
Reachability property qltransition_61 is true.
Reachability property qltransition_52 is true.
Reachability property qltransition_35 is true.
Reachability property qltransition_34 is true.
Reachability property qltransition_33 is true.
Reachability property qltransition_32 is true.
Reachability property qltransition_31 is true.
Reachability property qltransition_30 is true.
Reachability property qltransition_29 is true.
Reachability property qltransition_28 is true.
Reachability property qltransition_27 is true.
Reachability property qltransition_16 is true.
Reachability property qltransition_7 is true.
SDD proceeding with computation,130 properties remain. new max is 1024
SDD size :8331 after 11916
SDD proceeding with computation,130 properties remain. new max is 2048
SDD size :11916 after 13703
Reachability property qltransition_313 is true.
Parikh walk visited 1 properties in 1654 ms.
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 320/320 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 79 transition count 156
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 79 transition count 156
Reachability property qltransition_305 is true.
Applied a total of 72 rules in 16 ms. Remains 79 /115 variables (removed 36) and now considering 156/320 (removed 164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 79/115 places, 156/320 transitions.
Reachability property qltransition_297 is true.
Reachability property qltransition_289 is true.
Reachability property qltransition_281 is true.
Reachability property qltransition_279 is true.
Reachability property qltransition_274 is true.
Reachability property qltransition_269 is true.
Reachability property qltransition_264 is true.
Reachability property qltransition_259 is true.
Reachability property qltransition_221 is true.
Reachability property qltransition_220 is true.
Reachability property qltransition_219 is true.
Reachability property qltransition_218 is true.
Reachability property qltransition_217 is true.
Reachability property qltransition_216 is true.
Reachability property qltransition_206 is true.
Reachability property qltransition_197 is true.
Reachability property qltransition_188 is true.
Reachability property qltransition_176 is true.
Reachability property qltransition_175 is true.
Reachability property qltransition_174 is true.
Reachability property qltransition_173 is true.
Reachability property qltransition_172 is true.
Reachability property qltransition_171 is true.
Reachability property qltransition_161 is true.
Reachability property qltransition_152 is true.
Reachability property qltransition_143 is true.
Reachability property qltransition_131 is true.
Reachability property qltransition_130 is true.
Reachability property qltransition_129 is true.
Reachability property qltransition_128 is true.
Reachability property qltransition_127 is true.
Reachability property qltransition_126 is true.
Reachability property qltransition_116 is true.
Reachability property qltransition_107 is true.
Reachability property qltransition_98 is true.
Reachability property qltransition_86 is true.
Reachability property qltransition_85 is true.
Reachability property qltransition_84 is true.
Reachability property qltransition_83 is true.
Reachability property qltransition_82 is true.
Reachability property qltransition_81 is true.
Reachability property qltransition_71 is true.
Reachability property qltransition_62 is true.
Reachability property qltransition_53 is true.
Reachability property qltransition_41 is true.
Reachability property qltransition_40 is true.
Reachability property qltransition_39 is true.
Reachability property qltransition_38 is true.
Reachability property qltransition_37 is true.
Reachability property qltransition_36 is true.
SDD proceeding with computation,78 properties remain. new max is 2048
SDD size :13703 after 27400
Reachability property qltransition_283 is true.
SDD proceeding with computation,77 properties remain. new max is 2048
SDD size :27400 after 33481
Reachability property qltransition_315 is true.
Reachability property qltransition_307 is true.
Reachability property qltransition_299 is true.
Reachability property qltransition_291 is true.
Reachability property qltransition_222 is true.
Reachability property qltransition_177 is true.
Reachability property qltransition_132 is true.
Reachability property qltransition_87 is true.
Reachability property qltransition_42 is true.
SDD proceeding with computation,68 properties remain. new max is 2048
SDD size :33481 after 41795
Reachability property qltransition_285 is true.
SDD proceeding with computation,67 properties remain. new max is 2048
SDD size :41795 after 43684
RANDOM walk for 3273601 steps (7 resets) in 11541 ms. (283 steps per ms) remains 0/4 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 320 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 161/161 places, 365/365 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 161 transition count 345
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 141 transition count 345
Applied a total of 40 rules in 12 ms. Remains 141 /161 variables (removed 20) and now considering 345/365 (removed 20) transitions.
// Phase 1: matrix 345 rows 141 cols
[2024-05-20 16:57:32] [INFO ] Computed 13 invariants in 4 ms
[2024-05-20 16:57:32] [INFO ] Implicit Places using invariants in 506 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 508 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 140/161 places, 345/365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 320
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 115 transition count 320
Applied a total of 50 rules in 8 ms. Remains 115 /140 variables (removed 25) and now considering 320/345 (removed 25) transitions.
// Phase 1: matrix 320 rows 115 cols
[2024-05-20 16:57:32] [INFO ] Computed 12 invariants in 4 ms
[2024-05-20 16:57:33] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-20 16:57:33] [INFO ] Invariant cache hit.
[2024-05-20 16:57:33] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-20 16:57:34] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 115/161 places, 320/365 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1756 ms. Remains : 115/161 places, 320/365 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
[2024-05-20 16:57:34] [INFO ] Flatten gal took : 47 ms
[2024-05-20 16:57:34] [INFO ] Flatten gal took : 49 ms
[2024-05-20 16:57:34] [INFO ] Time to serialize gal into /tmp/CTLFireability4613111693510672029.gal : 8 ms
[2024-05-20 16:57:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17771080811639754231.ctl : 4 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4613111693510672029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17771080811639754231.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 16:57:37] [INFO ] Flatten gal took : 25 ms
[2024-05-20 16:57:37] [INFO ] Applying decomposition
[2024-05-20 16:57:37] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17098690297481145800.txt' '-o' '/tmp/graph17098690297481145800.bin' '-w' '/tmp/graph17098690297481145800.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17098690297481145800.bin' '-l' '-1' '-v' '-w' '/tmp/graph17098690297481145800.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:57:37] [INFO ] Decomposing Gal with order
[2024-05-20 16:57:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:57:37] [INFO ] Removed a total of 497 redundant transitions.
[2024-05-20 16:57:37] [INFO ] Flatten gal took : 113 ms
[2024-05-20 16:57:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 29 ms.
[2024-05-20 16:57:37] [INFO ] Time to serialize gal into /tmp/CTLFireability11906409602711480927.gal : 11 ms
[2024-05-20 16:57:37] [INFO ] Time to serialize properties into /tmp/CTLFireability18348584347111383575.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11906409602711480927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18348584347111383575.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 16:57:40] [INFO ] Flatten gal took : 22 ms
[2024-05-20 16:57:40] [INFO ] Flatten gal took : 22 ms
[2024-05-20 16:57:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17796238888666967064.gal : 5 ms
[2024-05-20 16:57:40] [INFO ] Time to serialize properties into /tmp/CTLFireability5656001746712605238.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17796238888666967064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5656001746712605238.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,184136,13.5341,302600,2,52395,5,849318,6,0,783,643639,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 16:58:11] [INFO ] Flatten gal took : 21 ms
[2024-05-20 16:58:11] [INFO ] Applying decomposition
[2024-05-20 16:58:11] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13939626670960110462.txt' '-o' '/tmp/graph13939626670960110462.bin' '-w' '/tmp/graph13939626670960110462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13939626670960110462.bin' '-l' '-1' '-v' '-w' '/tmp/graph13939626670960110462.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:58:11] [INFO ] Decomposing Gal with order
[2024-05-20 16:58:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:58:11] [INFO ] Removed a total of 501 redundant transitions.
[2024-05-20 16:58:11] [INFO ] Flatten gal took : 50 ms
[2024-05-20 16:58:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 12 ms.
[2024-05-20 16:58:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3350441737413279453.gal : 6 ms
[2024-05-20 16:58:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3474171987189451532.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3350441737413279453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3474171987189451532.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 16:58:41] [INFO ] Flatten gal took : 17 ms
[2024-05-20 16:58:41] [INFO ] Flatten gal took : 17 ms
[2024-05-20 16:58:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11902761090451848694.gal : 4 ms
[2024-05-20 16:58:41] [INFO ] Time to serialize properties into /tmp/CTLFireability4267197803967299911.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11902761090451848694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4267197803967299911.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,184136,15.6776,302024,2,52395,5,849318,6,0,783,643639,0


Converting to forward existential form...Done !
original formula: AG(EF(((((slot_T.F.F.F.F==1)&&(next_0==1))&&((ncs_0_0==1)&&(ncs_1_0==1)))&&(((ncs_2_0==1)&&(ncs_3_0==1))&&(ncs_4_0==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((slot_T.F.F.F.F==1)&&(next_0==1))&&((ncs_0_0==1)&&(ncs_1_0==1)))&&(((ncs_2_0==...200
Reverse transition relation is NOT exact ! Due to transitions ncs_to_p1_0_0_0, ncs_to_p1_0_0_1, ncs_to_p1_0_0_2, ncs_to_p1_0_0_3, ncs_to_p1_0_0_4, ncs_to_p...6232
(forward)formula 0,0,53.0174,958796,1,0,873,4.11644e+06,661,323,7015,1.40487e+06,648
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-20 16:59:34] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:59:34] [INFO ] Flatten gal took : 27 ms
[2024-05-20 16:59:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17447605206754921744.gal : 5 ms
[2024-05-20 16:59:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13349654604778129833.ctl : 9 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17447605206754921744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13349654604778129833.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 320 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 16:59:37] [INFO ] Flatten gal took : 30 ms
[2024-05-20 16:59:37] [INFO ] Applying decomposition
[2024-05-20 16:59:37] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17010586100739462206.txt' '-o' '/tmp/graph17010586100739462206.bin' '-w' '/tmp/graph17010586100739462206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17010586100739462206.bin' '-l' '-1' '-v' '-w' '/tmp/graph17010586100739462206.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:59:37] [INFO ] Decomposing Gal with order
[2024-05-20 16:59:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:59:37] [INFO ] Removed a total of 520 redundant transitions.
[2024-05-20 16:59:37] [INFO ] Flatten gal took : 77 ms
[2024-05-20 16:59:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 17 ms.
[2024-05-20 16:59:37] [INFO ] Time to serialize gal into /tmp/CTLFireability18020608502663301756.gal : 6 ms
[2024-05-20 16:59:37] [INFO ] Time to serialize properties into /tmp/CTLFireability11143258115957076167.ctl : 8 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18020608502663301756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11143258115957076167.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 320 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 16:59:41] [INFO ] Flatten gal took : 31 ms
[2024-05-20 16:59:41] [INFO ] Flatten gal took : 25 ms
[2024-05-20 16:59:41] [INFO ] Time to serialize gal into /tmp/CTLFireability13251993936688944961.gal : 3 ms
[2024-05-20 16:59:41] [INFO ] Time to serialize properties into /tmp/CTLFireability2195420167610307560.ctl : 5 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13251993936688944961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2195420167610307560.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 320 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,184136,16.0281,302728,2,52395,5,849318,6,0,783,643639,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 17:00:11] [INFO ] Flatten gal took : 15 ms
[2024-05-20 17:00:11] [INFO ] Applying decomposition
[2024-05-20 17:00:11] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13988201288179139789.txt' '-o' '/tmp/graph13988201288179139789.bin' '-w' '/tmp/graph13988201288179139789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13988201288179139789.bin' '-l' '-1' '-v' '-w' '/tmp/graph13988201288179139789.weights' '-q' '0' '-e' '0.001'
[2024-05-20 17:00:11] [INFO ] Decomposing Gal with order
[2024-05-20 17:00:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 17:00:11] [INFO ] Removed a total of 475 redundant transitions.
[2024-05-20 17:00:11] [INFO ] Flatten gal took : 45 ms
[2024-05-20 17:00:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 9 ms.
[2024-05-20 17:00:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14037567552159673221.gal : 4 ms
[2024-05-20 17:00:11] [INFO ] Time to serialize properties into /tmp/CTLFireability11949183819405449130.ctl : 3 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14037567552159673221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11949183819405449130.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 320 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 17:00:41] [INFO ] Flatten gal took : 15 ms
[2024-05-20 17:00:41] [INFO ] Flatten gal took : 14 ms
[2024-05-20 17:00:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11431387848320668778.gal : 3 ms
[2024-05-20 17:00:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3124917616533099025.ctl : 3 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11431387848320668778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3124917616533099025.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 320 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,184136,13.2624,302088,2,52395,5,849318,6,0,783,643639,0


Converting to forward existential form...Done !
original formula: AG(EF(((next_0==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_0_0==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions ncs_to_p1_0_0_0, ncs_to_p1_0_0_1, ncs_to_p1_0_0_2, ncs_to_p1_0_0_3, ncs_to_p1_0_0_4, ncs_to_p...6232
(forward)formula 0,1,77.5667,1691912,1,0,955,1.07168e+07,661,372,7099,2.67101e+06,773
Formula is TRUE !

***************************************

original formula: AG(EF(((next_1==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 1,1,87.5512,1971336,1,0,999,1.28321e+07,662,398,7101,3.06399e+06,839
Formula is TRUE !

***************************************

original formula: AG(EF(((next_2==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 2,1,128.238,2200512,1,0,1039,1.44287e+07,14,420,2631,3.36352e+06,65
Formula is TRUE !

***************************************

original formula: AG(EF(((next_3==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 3,1,137.39,2200512,1,0,1039,1.44287e+07,15,420,2633,3.36352e+06,136
Formula is TRUE !

***************************************

original formula: AG(EF(((next_4==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 4,1,142.489,2200512,1,0,1039,1.44287e+07,16,420,2635,3.36352e+06,212
Formula is TRUE !

***************************************

original formula: AG(EF(((next_5==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 5,1,147.107,2200512,1,0,1039,1.44287e+07,17,420,2637,3.36352e+06,293
Formula is TRUE !

***************************************

original formula: AG(EF(((next_6==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 6,1,148.47,2200512,1,0,1039,1.44287e+07,18,420,2639,3.36352e+06,364
Formula is TRUE !

***************************************

original formula: AG(EF(((next_7==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 7,1,148.897,2200512,1,0,1039,1.44287e+07,19,420,2641,3.36352e+06,440
Formula is TRUE !

***************************************

original formula: AG(EF(((next_8==1)&&(ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_0_0==1)))))] = FALSE
(forward)formula 8,1,150.359,2200512,1,0,1039,1.44287e+07,20,420,2643,3.36352e+06,556
Formula is TRUE !

***************************************

original formula: AG(EF(((next_0==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 9,1,196.577,2457840,1,0,1039,1.94438e+07,14,420,2631,3.64313e+06,25
Formula is TRUE !

***************************************

original formula: AG(EF(((next_1==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 10,1,214.521,2457840,1,0,1039,1.94438e+07,15,420,2633,3.64313e+06,132
Formula is TRUE !

***************************************

original formula: AG(EF(((next_2==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 11,1,222.491,2457840,1,0,1039,1.94438e+07,16,420,2635,3.64313e+06,213
Formula is TRUE !

***************************************

original formula: AG(EF(((next_3==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 12,1,228.918,2457840,1,0,1039,1.94438e+07,17,420,2637,3.64313e+06,284
Formula is TRUE !

***************************************

original formula: AG(EF(((next_4==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 13,1,232.661,2457840,1,0,1039,1.94438e+07,18,420,2639,3.64313e+06,350
Formula is TRUE !

***************************************

original formula: AG(EF(((next_5==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 14,1,236.039,2457840,1,0,1039,1.94438e+07,19,420,2641,3.64313e+06,431
Formula is TRUE !

***************************************

original formula: AG(EF(((next_6==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 15,1,241.172,2457840,1,0,1039,1.94438e+07,20,420,2643,3.64313e+06,527
Formula is TRUE !

***************************************

original formula: AG(EF(((next_7==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 16,1,241.628,2457840,1,0,1039,1.94438e+07,21,420,2645,3.64313e+06,603
Formula is TRUE !

***************************************

original formula: AG(EF(((next_8==1)&&(ncs_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_0_1==1)))))] = FALSE
(forward)formula 17,1,243.03,2457840,1,0,1039,1.94438e+07,22,420,2647,3.64313e+06,719
Formula is TRUE !

***************************************

original formula: AG(EF(((next_0==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 18,1,296.777,2725016,1,0,1039,2.1202e+07,14,420,2631,3.92371e+06,70
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-20 17:05:41] [INFO ] Flatten gal took : 28 ms
[2024-05-20 17:05:41] [INFO ] Applying decomposition
[2024-05-20 17:05:41] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7904444202617476367.txt' '-o' '/tmp/graph7904444202617476367.bin' '-w' '/tmp/graph7904444202617476367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7904444202617476367.bin' '-l' '-1' '-v' '-w' '/tmp/graph7904444202617476367.weights' '-q' '0' '-e' '0.001'
[2024-05-20 17:05:41] [INFO ] Decomposing Gal with order
[2024-05-20 17:05:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 17:05:41] [INFO ] Removed a total of 534 redundant transitions.
[2024-05-20 17:05:41] [INFO ] Flatten gal took : 48 ms
[2024-05-20 17:05:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 10 ms.
[2024-05-20 17:05:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1624162246231818263.gal : 5 ms
[2024-05-20 17:05:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12229288362259621707.ctl : 5 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1624162246231818263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12229288362259621707.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 301 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,184136,81.7426,1099428,6064,2293,630720,78542,686,9.54307e+06,191,1.97269e+06,0


Converting to forward existential form...Done !
original formula: AG(EF(((u3.next_1==1)&&(i2.u2.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_1==1)&&(i2.u2.ncs_0_2==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions ncs_to_p1_0_0_0, ncs_to_p1_0_0_1, ncs_to_p1_0_0_2, ncs_to_p1_0_0_3, ncs_to_p1_0_0_4, ncs_to_p...4950
(forward)formula 0,1,178.293,1756984,1,0,956707,213427,2599,1.71934e+07,888,2.58397e+06,2195738
Formula is TRUE !

***************************************

original formula: AG(EF(((i2.u4.next_2==1)&&(i2.u2.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u4.next_2==1)&&(i2.u2.ncs_0_2==1)))))] = FALSE
(forward)formula 1,1,188.968,1804504,1,0,1.01096e+06,213676,2606,1.73803e+07,889,2.60674e+06,2324986
Formula is TRUE !

***************************************

original formula: AG(EF(((i2.u5.next_3==1)&&(i2.u2.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u5.next_3==1)&&(i2.u2.ncs_0_2==1)))))] = FALSE
(forward)formula 2,1,232.042,1992208,1,0,1.14548e+06,216453,2612,1.86988e+07,889,2.62496e+06,2643524
Formula is TRUE !

***************************************

original formula: AG(EF(((i3.u6.next_4==1)&&(i2.u2.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i3.u6.next_4==1)&&(i2.u2.ncs_0_2==1)))))] = FALSE
(forward)formula 3,1,242.572,2034712,1,0,1.20074e+06,216748,2617,1.87786e+07,890,2.62909e+06,2812629
Formula is TRUE !

***************************************

original formula: AG(EF(((i3.u6.next_5==1)&&(i2.u2.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i3.u6.next_5==1)&&(i2.u2.ncs_0_2==1)))))] = FALSE
(forward)formula 4,1,256.483,2073784,1,0,1.24963e+06,216830,2622,1.88518e+07,891,2.63158e+06,2947635
Formula is TRUE !

***************************************

original formula: AG(EF(((i4.u7.next_6==1)&&(i2.u2.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i4.u7.next_6==1)&&(i2.u2.ncs_0_2==1)))))] = FALSE
(forward)formula 5,1,275.917,2105728,1,0,1.27566e+06,216933,2627,1.89102e+07,892,2.6337e+06,3011625
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-20 17:10:42] [INFO ] Flatten gal took : 14 ms
[2024-05-20 17:10:42] [INFO ] Flatten gal took : 14 ms
[2024-05-20 17:10:42] [INFO ] Time to serialize gal into /tmp/CTLFireability5501265557818281711.gal : 3 ms
[2024-05-20 17:10:42] [INFO ] Time to serialize properties into /tmp/CTLFireability17658754493403761917.ctl : 3 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5501265557818281711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17658754493403761917.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 295 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,184136,13.5405,302904,2,52395,5,849318,6,0,783,643639,0


Converting to forward existential form...Done !
original formula: AG(EF(((next_7==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_0_2==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions ncs_to_p1_0_0_0, ncs_to_p1_0_0_1, ncs_to_p1_0_0_2, ncs_to_p1_0_0_3, ncs_to_p1_0_0_4, ncs_to_p...6232
(forward)formula 0,1,74.3299,1575740,1,0,962,9.79329e+06,661,375,6919,2.52956e+06,783
Formula is TRUE !

***************************************

original formula: AG(EF(((next_8==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 1,1,79.8303,1730632,1,0,1053,1.10356e+07,662,430,6921,2.80468e+06,924
Formula is TRUE !

***************************************

original formula: AG(EF(((next_0==1)&&(ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_0_3==1)))))] = FALSE
(forward)formula 2,1,129.315,2204792,1,0,1091,1.43145e+07,14,450,2631,3.35562e+06,75
Formula is TRUE !

***************************************

original formula: AG(EF(((next_1==1)&&(ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_0_3==1)))))] = FALSE
(forward)formula 3,1,137.242,2204792,1,0,1091,1.43145e+07,15,450,2633,3.35562e+06,146
Formula is TRUE !

***************************************

original formula: AG(EF(((next_2==1)&&(ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_0_3==1)))))] = FALSE
(forward)formula 4,1,140.606,2204792,1,0,1091,1.43145e+07,16,450,2635,3.35562e+06,217
Formula is TRUE !

***************************************

original formula: AG(EF(((next_3==1)&&(ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_0_3==1)))))] = FALSE
(forward)formula 5,1,143.258,2204792,1,0,1091,1.43145e+07,17,450,2637,3.35562e+06,293
Formula is TRUE !

***************************************

original formula: AG(EF(((next_4==1)&&(ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_0_3==1)))))] = FALSE
(forward)formula 6,1,146.207,2204792,1,0,1091,1.43145e+07,18,450,2639,3.35562e+06,359
Formula is TRUE !

***************************************

original formula: AG(EF(((next_5==1)&&(ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_0_3==1)))))] = FALSE
(forward)formula 7,1,148.834,2204792,1,0,1091,1.43145e+07,19,450,2641,3.35562e+06,440
Formula is TRUE !

***************************************

original formula: AG(EF(((next_6==1)&&(ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_0_3==1)))))] = FALSE
(forward)formula 8,1,150.675,2204792,1,0,1091,1.43145e+07,20,450,2643,3.35562e+06,536
Formula is TRUE !

***************************************

original formula: AG(EF(((next_7==1)&&(ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_0_3==1)))))] = FALSE
(forward)formula 9,1,153.448,2204792,1,0,1091,1.43145e+07,21,450,2645,3.35562e+06,647
Formula is TRUE !

***************************************

original formula: AG(EF(((next_8==1)&&(ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_0_3==1)))))] = FALSE
(forward)formula 10,1,157.733,2215032,1,0,1091,1.54517e+07,22,450,2647,3.35562e+06,763
Formula is TRUE !

***************************************

original formula: AG(EF(((next_0==1)&&(ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_0_4==1)))))] = FALSE
(forward)formula 11,1,202.315,2463888,1,0,1091,1.9597e+07,14,450,2631,3.53512e+06,55
Formula is TRUE !

***************************************

original formula: AG(EF(((next_1==1)&&(ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_0_4==1)))))] = FALSE
(forward)formula 12,1,213.506,2463888,1,0,1091,1.9597e+07,15,450,2633,3.53512e+06,126
Formula is TRUE !

***************************************

original formula: AG(EF(((next_2==1)&&(ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_0_4==1)))))] = FALSE
(forward)formula 13,1,217.895,2463888,1,0,1091,1.9597e+07,16,450,2635,3.53512e+06,197
Formula is TRUE !

***************************************

original formula: AG(EF(((next_3==1)&&(ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_0_4==1)))))] = FALSE
(forward)formula 14,1,221.595,2463888,1,0,1091,1.9597e+07,17,450,2637,3.53512e+06,268
Formula is TRUE !

***************************************

original formula: AG(EF(((next_4==1)&&(ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_0_4==1)))))] = FALSE
(forward)formula 15,1,225.005,2463888,1,0,1091,1.9597e+07,18,450,2639,3.53512e+06,339
Formula is TRUE !

***************************************

original formula: AG(EF(((next_5==1)&&(ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_0_4==1)))))] = FALSE
(forward)formula 16,1,227.453,2463888,1,0,1091,1.9597e+07,19,450,2641,3.53512e+06,410
Formula is TRUE !

***************************************

original formula: AG(EF(((next_6==1)&&(ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_0_4==1)))))] = FALSE
(forward)formula 17,1,228.842,2463888,1,0,1091,1.9597e+07,20,450,2643,3.53512e+06,481
Formula is TRUE !

***************************************

original formula: AG(EF(((next_7==1)&&(ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_0_4==1)))))] = FALSE
(forward)formula 18,1,229.299,2463888,1,0,1091,1.9597e+07,21,450,2645,3.53512e+06,557
Formula is TRUE !

***************************************

original formula: AG(EF(((next_8==1)&&(ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_0_4==1)))))] = FALSE
(forward)formula 19,1,230.589,2463888,1,0,1091,1.9597e+07,22,450,2647,3.53512e+06,678
Formula is TRUE !

***************************************

original formula: AG(EF(((next_0==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 20,1,255.37,2545328,1,0,1091,2.02171e+07,23,450,2649,3.7604e+06,804
Formula is TRUE !

***************************************

original formula: AG(EF(((next_1==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 21,1,300.4,2733860,1,0,1091,2.14441e+07,14,450,2631,3.96734e+06,85
Formula is TRUE !

***************************************

original formula: AG(EF(((next_2==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 22,1,308.863,2733860,1,0,1091,2.14441e+07,15,450,2633,3.96734e+06,156
Formula is TRUE !

***************************************

original formula: AG(EF(((next_3==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 23,1,314.353,2733860,1,0,1091,2.14441e+07,16,450,2635,3.96734e+06,227
Formula is TRUE !

***************************************

original formula: AG(EF(((next_4==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 24,1,320.079,2733860,1,0,1091,2.14441e+07,17,450,2637,3.96734e+06,303
Formula is TRUE !

***************************************

original formula: AG(EF(((next_5==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 25,1,324.783,2733860,1,0,1091,2.14441e+07,18,450,2639,3.96734e+06,384
Formula is TRUE !

***************************************

original formula: AG(EF(((next_6==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 26,1,326.338,2733860,1,0,1091,2.14441e+07,19,450,2641,3.96734e+06,455
Formula is TRUE !

***************************************

original formula: AG(EF(((next_7==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 27,1,326.83,2733860,1,0,1091,2.14441e+07,20,450,2643,3.96734e+06,531
Formula is TRUE !

***************************************

original formula: AG(EF(((next_8==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 28,1,328.39,2733860,1,0,1091,2.14441e+07,21,450,2645,3.96734e+06,647
Formula is TRUE !

***************************************

original formula: AG(EF(((next_0==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 29,1,355.226,2822692,1,0,1091,2.20816e+07,22,450,2648,4.13157e+06,768
Formula is TRUE !

***************************************

original formula: AG(EF(((next_1==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 30,1,368.45,2977396,1,0,1091,2.33833e+07,23,450,2649,4.37319e+06,839
Formula is TRUE !

***************************************

original formula: AG(EF(((next_2==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 31,1,416.127,3007320,1,0,1091,2.45337e+07,14,450,2631,4.57196e+06,80
Formula is TRUE !

***************************************

original formula: AG(EF(((next_3==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 32,1,424.845,3007320,1,0,1091,2.45337e+07,15,450,2633,4.57196e+06,151
Formula is TRUE !

***************************************

original formula: AG(EF(((next_4==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 33,1,430.912,3007320,1,0,1091,2.45337e+07,16,450,2635,4.57196e+06,237
Formula is TRUE !

***************************************

original formula: AG(EF(((next_5==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 34,1,434.301,3007320,1,0,1091,2.45337e+07,17,450,2637,4.57196e+06,318
Formula is TRUE !

***************************************

original formula: AG(EF(((next_6==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 35,1,438.956,3007320,1,0,1091,2.45337e+07,18,450,2639,4.57196e+06,414
Formula is TRUE !

***************************************

original formula: AG(EF(((next_7==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 36,1,439.375,3007320,1,0,1091,2.45337e+07,19,450,2641,4.57196e+06,490
Formula is TRUE !

***************************************

original formula: AG(EF(((next_8==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 37,1,440.641,3007320,1,0,1091,2.45337e+07,20,450,2643,4.57196e+06,606
Formula is TRUE !

***************************************

original formula: AG(EF(((next_0==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 38,1,463.762,3007320,1,0,1091,2.45337e+07,21,450,2646,4.57196e+06,732
Formula is TRUE !

***************************************

original formula: AG(EF(((next_1==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 39,1,467.344,3007320,1,0,1091,2.45337e+07,22,450,2648,4.57196e+06,803
Formula is TRUE !

***************************************

original formula: AG(EF(((next_2==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 40,1,470.347,3007320,1,0,1091,2.45337e+07,23,450,2649,4.57196e+06,879
Formula is TRUE !

***************************************

original formula: AG(EF(((next_3==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 41,1,480.23,3062028,1,0,1091,2.52217e+07,24,450,2650,4.77289e+06,995
Formula is TRUE !

***************************************

original formula: AG(EF(((next_4==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 42,1,483.288,3136724,1,0,1091,2.585e+07,25,450,2651,4.89496e+06,1061
Formula is TRUE !

***************************************

original formula: AG(EF(((next_5==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 43,1,486.375,3211496,1,0,1091,2.64631e+07,26,450,2652,4.99857e+06,1142
Formula is TRUE !

***************************************

original formula: AG(EF(((next_6==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 44,1,534.572,3284880,1,0,1091,2.70426e+07,14,480,2631,5.12356e+06,45
Formula is TRUE !

***************************************

original formula: AG(EF(((next_7==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 45,1,545.331,3284880,1,0,1091,2.70426e+07,15,480,2633,5.12356e+06,156
Formula is TRUE !

***************************************

original formula: AG(EF(((next_8==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 46,1,549.324,3284880,1,0,1091,2.70426e+07,16,480,2635,5.12356e+06,297
Formula is TRUE !

***************************************

original formula: AG(EF(((next_0==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 47,1,566.037,3284880,1,0,1091,2.70426e+07,17,480,2638,5.12356e+06,418
Formula is TRUE !

***************************************

original formula: AG(EF(((next_1==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 48,1,570.641,3284880,1,0,1091,2.70426e+07,18,480,2640,5.12356e+06,489
Formula is TRUE !

***************************************

original formula: AG(EF(((next_2==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 49,1,572.86,3284880,1,0,1091,2.70426e+07,19,480,2642,5.12356e+06,560
Formula is TRUE !

***************************************

original formula: AG(EF(((next_3==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 50,1,575.046,3284880,1,0,1091,2.70426e+07,20,480,2644,5.12356e+06,636
Formula is TRUE !

***************************************

original formula: AG(EF(((next_4==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 51,1,577.895,3284880,1,0,1091,2.70426e+07,21,480,2646,5.12356e+06,702
Formula is TRUE !

***************************************

original formula: AG(EF(((next_5==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 52,1,580.199,3284880,1,0,1091,2.70426e+07,22,480,2648,5.12356e+06,783
Formula is TRUE !

***************************************

original formula: AG(EF(((next_6==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 53,1,581.79,3284880,1,0,1091,2.70426e+07,23,480,2649,5.12356e+06,879
Formula is TRUE !

***************************************

original formula: AG(EF(((next_7==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 54,1,584.258,3284880,1,0,1091,2.70426e+07,24,480,2650,5.12356e+06,990
Formula is TRUE !

***************************************

original formula: AG(EF(((next_8==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 55,1,587.559,3284880,1,0,1091,2.70426e+07,25,480,2651,5.12356e+06,1106
Formula is TRUE !

***************************************

original formula: AG(EF(((next_0==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 56,1,605.396,3284880,1,0,1091,2.70426e+07,26,480,2653,5.12356e+06,1217
Formula is TRUE !

***************************************

original formula: AG(EF(((next_1==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 57,1,610.678,3362024,1,0,1091,2.79621e+07,27,500,2654,5.16102e+06,1288
Formula is TRUE !

***************************************

original formula: AG(EF(((next_2==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 58,1,614.712,3475800,1,0,1091,2.89381e+07,28,528,2655,5.34817e+06,1359
Formula is TRUE !

***************************************

original formula: AG(EF(((next_3==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 59,1,618.337,3577500,1,0,1091,2.97782e+07,29,556,2656,5.50949e+06,1430
Formula is TRUE !

***************************************

original formula: AG(EF(((next_4==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 60,1,666.162,3619168,1,0,1091,3.00993e+07,14,564,2631,5.56221e+06,110
Formula is TRUE !

***************************************

original formula: AG(EF(((next_5==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 61,1,670.051,3619168,1,0,1091,3.00993e+07,15,564,2633,5.56221e+06,181
Formula is TRUE !

***************************************

original formula: AG(EF(((next_6==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 62,1,671.473,3619168,1,0,1091,3.00993e+07,16,564,2635,5.56221e+06,252
Formula is TRUE !

***************************************

original formula: AG(EF(((next_7==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 63,1,671.919,3619168,1,0,1091,3.00993e+07,17,564,2637,5.56221e+06,328
Formula is TRUE !

***************************************

original formula: AG(EF(((next_8==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 64,1,673.708,3619168,1,0,1091,3.00993e+07,18,564,2639,5.56221e+06,449
Formula is TRUE !

***************************************

original formula: AG(EF(((next_0==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 65,1,692.975,3619168,1,0,1091,3.00993e+07,19,564,2642,5.56221e+06,575
Formula is TRUE !

***************************************

original formula: AG(EF(((next_1==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 66,1,700.262,3619168,1,0,1091,3.00993e+07,20,564,2644,5.56221e+06,641
Formula is TRUE !

***************************************

original formula: AG(EF(((next_2==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 67,1,706.551,3619168,1,0,1091,3.00993e+07,21,564,2646,5.56221e+06,712
Formula is TRUE !

***************************************

original formula: AG(EF(((next_3==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 68,1,711.662,3619168,1,0,1091,3.00993e+07,22,564,2648,5.56221e+06,783
Formula is TRUE !

***************************************

original formula: AG(EF(((next_4==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 69,1,715.06,3619168,1,0,1091,3.00993e+07,23,564,2649,5.56221e+06,849
Formula is TRUE !

***************************************

original formula: AG(EF(((next_5==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 70,1,719.095,3619168,1,0,1091,3.00993e+07,24,564,2650,5.56221e+06,930
Formula is TRUE !

***************************************

original formula: AG(EF(((next_6==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 71,1,720.581,3619168,1,0,1091,3.00993e+07,25,564,2651,5.56221e+06,1001
Formula is TRUE !

***************************************

original formula: AG(EF(((next_7==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 72,1,721.054,3619168,1,0,1091,3.00993e+07,26,564,2652,5.56221e+06,1077
Formula is TRUE !

***************************************

original formula: AG(EF(((next_8==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 73,1,722.582,3619168,1,0,1091,3.00993e+07,27,564,2653,5.56221e+06,1193
Formula is TRUE !

***************************************

original formula: AG(EF(((next_0==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 74,1,744.896,3663516,1,0,1091,3.00993e+07,28,564,2655,5.64237e+06,1314
Formula is TRUE !

***************************************

original formula: AG(EF(((next_1==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 75,1,750.377,3813724,1,0,1091,3.12925e+07,29,564,2656,5.87021e+06,1385
Formula is TRUE !

***************************************

original formula: AG(EF(((next_2==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 76,1,806.554,3999468,1,0,1091,3.2841e+07,14,564,2631,6.1435e+06,70
Formula is TRUE !

***************************************

original formula: AG(EF(((next_3==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 77,1,816.059,3999468,1,0,1091,3.2841e+07,15,564,2633,6.1435e+06,141
Formula is TRUE !

***************************************

original formula: AG(EF(((next_4==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 78,1,821.818,3999468,1,0,1091,3.2841e+07,16,564,2635,6.1435e+06,227
Formula is TRUE !

***************************************

original formula: AG(EF(((next_5==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 79,1,825.166,3999468,1,0,1091,3.2841e+07,17,564,2637,6.1435e+06,308
Formula is TRUE !

***************************************

original formula: AG(EF(((next_6==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 80,1,829.417,3999468,1,0,1091,3.2841e+07,18,564,2639,6.1435e+06,404
Formula is TRUE !

***************************************

original formula: AG(EF(((next_7==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 81,1,829.811,3999468,1,0,1091,3.2841e+07,19,564,2641,6.1435e+06,480
Formula is TRUE !

***************************************

original formula: AG(EF(((next_8==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 82,1,830.991,3999468,1,0,1091,3.2841e+07,20,564,2643,6.1435e+06,596
Formula is TRUE !

***************************************

original formula: AG(EF(((next_0==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 83,1,851.452,3999468,1,0,1091,3.2841e+07,21,564,2646,6.1435e+06,722
Formula is TRUE !

***************************************

original formula: AG(EF(((next_1==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 84,1,854.332,3999468,1,0,1091,3.2841e+07,22,564,2648,6.1435e+06,793
Formula is TRUE !

***************************************

original formula: AG(EF(((next_2==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 85,1,856.658,3999468,1,0,1091,3.2841e+07,23,564,2649,6.1435e+06,869
Formula is TRUE !

***************************************

original formula: AG(EF(((next_3==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 86,1,864.676,3999468,1,0,1091,3.2841e+07,24,564,2650,6.1435e+06,985
Formula is TRUE !

***************************************

original formula: AG(EF(((next_4==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 87,1,867.092,3999468,1,0,1091,3.2841e+07,25,564,2651,6.1435e+06,1051
Formula is TRUE !

***************************************

original formula: AG(EF(((next_5==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 88,1,869.493,3999484,1,0,1091,3.2841e+07,26,564,2652,6.1435e+06,1132
Formula is TRUE !

***************************************

original formula: AG(EF(((next_6==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 89,1,871.702,3999484,1,0,1091,3.2841e+07,27,564,2653,6.1435e+06,1228
Formula is TRUE !

***************************************

original formula: AG(EF(((next_7==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 90,1,875.343,3999484,1,0,1091,3.2841e+07,28,564,2654,6.1435e+06,1339
Formula is TRUE !

***************************************

original formula: AG(EF(((next_8==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 91,1,876.575,3999484,1,0,1091,3.2841e+07,29,565,2655,6.1435e+06,1455
Formula is TRUE !

***************************************

original formula: AG(EF(((next_0==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 92,1,894.397,3999484,1,0,1091,3.2841e+07,30,612,2657,6.1435e+06,1576
Formula is TRUE !

***************************************

original formula: AG(EF(((next_1==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 93,1,898.188,3999484,1,0,1091,3.2841e+07,31,640,2658,6.1435e+06,1647
Formula is TRUE !

***************************************

original formula: AG(EF(((next_2==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 94,1,900.813,4061360,1,0,1129,3.32082e+07,32,668,2659,6.18302e+06,1718
Formula is TRUE !

***************************************

original formula: AG(EF(((next_3==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 95,1,903.411,4125628,1,0,1177,3.37454e+07,33,697,2660,6.27776e+06,1794
Formula is TRUE !

***************************************

original formula: AG(EF(((next_4==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 96,1,906.439,4204360,1,0,1220,3.44205e+07,34,723,2661,6.3979e+06,1860
Formula is TRUE !

***************************************

original formula: AG(EF(((next_5==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 97,1,909.34,4282812,1,0,1273,3.50675e+07,35,754,2662,6.49545e+06,1941
Formula is TRUE !

***************************************

original formula: AG(EF(((next_6==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 98,1,911.247,4328416,1,0,1338,3.54836e+07,36,791,2663,6.58115e+06,2037
Formula is TRUE !

BK_TIME_CONFINEMENT_REACHED

--------------------
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="Anderson-PT-05"
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 Anderson-PT-05, 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 r013-smll-171620124600204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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