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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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 15K Apr 12 15:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 15:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 15:50 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 103K 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 1716223851077

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-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202405141337
[2024-05-20 16:50:53] [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:50:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 16:50:53] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-05-20 16:50:53] [INFO ] Transformed 105 places.
[2024-05-20 16:50:53] [INFO ] Transformed 200 transitions.
[2024-05-20 16:50:53] [INFO ] Found NUPN structural information;
[2024-05-20 16:50:53] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 381 ms.
Built sparse matrix representations for Structural reductions in 11 ms.17786KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 105/105 places, 200/200 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 50 ms. Remains 105 /105 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 82 ms. Remains : 105/105 places, 200/200 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 105/105 places, 200/200 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 21 ms. Remains 105 /105 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 105 cols
[2024-05-20 16:50:54] [INFO ] Computed 11 invariants in 30 ms
[2024-05-20 16:50:54] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-20 16:50:54] [INFO ] Invariant cache hit.
[2024-05-20 16:50:54] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-20 16:50:54] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2024-05-20 16:50:54] [INFO ] Redundant transitions in 14 ms returned []
Running 196 sub problems to find dead transitions.
[2024-05-20 16:50:54] [INFO ] Invariant cache hit.
[2024-05-20 16:50:54] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-20 16:50:57] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 40 ms to minimize.
[2024-05-20 16:50:57] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 3 ms to minimize.
[2024-05-20 16:50:57] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-05-20 16:50:57] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 3 ms to minimize.
[2024-05-20 16:50:57] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 2 ms to minimize.
[2024-05-20 16:50:57] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-20 16:50:57] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-05-20 16:50:57] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 3 ms to minimize.
[2024-05-20 16:50:58] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 2 ms to minimize.
[2024-05-20 16:50:58] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-05-20 16:50:58] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 2 ms to minimize.
[2024-05-20 16:50:58] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-20 16:50:58] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 3 ms to minimize.
[2024-05-20 16:50:58] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 3 ms to minimize.
[2024-05-20 16:50:58] [INFO ] Deduced a trap composed of 68 places in 151 ms of which 4 ms to minimize.
[2024-05-20 16:50:59] [INFO ] Deduced a trap composed of 78 places in 152 ms of which 2 ms to minimize.
[2024-05-20 16:50:59] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 4 ms to minimize.
[2024-05-20 16:50:59] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2024-05-20 16:50:59] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 2 ms to minimize.
[2024-05-20 16:50:59] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-20 16:51:01] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-20 16:51:01] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-20 16:51:01] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 1 ms to minimize.
[2024-05-20 16:51:02] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-05-20 16:51:02] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-05-20 16:51:02] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-05-20 16:51:02] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-20 16:51:02] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-05-20 16:51:02] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 2 ms to minimize.
[2024-05-20 16:51:03] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-05-20 16:51:03] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 2 ms to minimize.
[2024-05-20 16:51:03] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-20 16:51:03] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-05-20 16:51:03] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 2 ms to minimize.
[2024-05-20 16:51:03] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 7 ms to minimize.
[2024-05-20 16:51:03] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-05-20 16:51:03] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-20 16:51:03] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-20 16:51:03] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-20 16:51:04] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-20 16:51:04] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-05-20 16:51:04] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-20 16:51:04] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 2 ms to minimize.
[2024-05-20 16:51:04] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-05-20 16:51:04] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2024-05-20 16:51:05] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 2 ms to minimize.
[2024-05-20 16:51:05] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-20 16:51:05] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2024-05-20 16:51:05] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-05-20 16:51:05] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-05-20 16:51:06] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 3 ms to minimize.
[2024-05-20 16:51:06] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2024-05-20 16:51:06] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-20 16:51:06] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2024-05-20 16:51:06] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-05-20 16:51:06] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 3 ms to minimize.
[2024-05-20 16:51:06] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 2 ms to minimize.
[2024-05-20 16:51:06] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2024-05-20 16:51:07] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 3 ms to minimize.
[2024-05-20 16:51:07] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-20 16:51:07] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-05-20 16:51:07] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 2 ms to minimize.
[2024-05-20 16:51:08] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 2 ms to minimize.
[2024-05-20 16:51:08] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 3 ms to minimize.
[2024-05-20 16:51:08] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 3 ms to minimize.
[2024-05-20 16:51:08] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 2 ms to minimize.
[2024-05-20 16:51:09] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-05-20 16:51:09] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 2 ms to minimize.
[2024-05-20 16:51:09] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 2 ms to minimize.
[2024-05-20 16:51:09] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-05-20 16:51:09] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 2 ms to minimize.
[2024-05-20 16:51:09] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 2 ms to minimize.
[2024-05-20 16:51:09] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 3 ms to minimize.
[2024-05-20 16:51:09] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 2 ms to minimize.
[2024-05-20 16:51:10] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-20 16:51:10] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-05-20 16:51:10] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-05-20 16:51:10] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-20 16:51:10] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-05-20 16:51:10] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-20 16:51:13] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-20 16:51:14] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-20 16:51:15] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-05-20 16:51:15] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 2 ms to minimize.
[2024-05-20 16:51:17] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-20 16:51:18] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 2 ms to minimize.
[2024-05-20 16:51:18] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-05-20 16:51:18] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 1 ms to minimize.
[2024-05-20 16:51:18] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-20 16:51:22] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-20 16:51:25] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 3 ms to minimize.
[2024-05-20 16:51:25] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/305 variables, and 208 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30065 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/105 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 92/208 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-20 16:51:27] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 2 ms to minimize.
[2024-05-20 16:51:27] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-20 16:51:27] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 2 ms to minimize.
[2024-05-20 16:51:27] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2024-05-20 16:51:27] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-20 16:51:28] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 2 ms to minimize.
[2024-05-20 16:51:28] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
[2024-05-20 16:51:29] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2024-05-20 16:51:29] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 2 ms to minimize.
[2024-05-20 16:51:29] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-20 16:51:29] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-05-20 16:51:29] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 12/220 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-20 16:51:31] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-20 16:51:34] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-05-20 16:51:35] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-05-20 16:51:36] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-20 16:51:40] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-20 16:51:51] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/305 variables, and 226 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30022 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/105 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 0/196 constraints, Known Traps: 110/110 constraints]
After SMT, in 60590ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 60636ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61555 ms. Remains : 105/105 places, 200/200 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1605 ms (no deadlock found). (steps per millisecond=778 )
Random directed walk for 1250000 steps, including 0 resets, run took 1372 ms (no deadlock found). (steps per millisecond=911 )
[2024-05-20 16:51:58] [INFO ] Invariant cache hit.
[2024-05-20 16:51:58] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-20 16:51:58] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 40 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 105/105 places, 200/200 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 105 transition count 188
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 188
Applied a total of 24 rules in 70 ms. Remains 93 /105 variables (removed 12) and now considering 188/200 (removed 12) transitions.
// Phase 1: matrix 188 rows 93 cols
[2024-05-20 16:51:58] [INFO ] Computed 11 invariants in 6 ms
[2024-05-20 16:51:59] [INFO ] Implicit Places using invariants in 336 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 350 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 92/105 places, 188/200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 92 transition count 172
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 76 transition count 172
Applied a total of 32 rules in 11 ms. Remains 76 /92 variables (removed 16) and now considering 172/188 (removed 16) transitions.
// Phase 1: matrix 172 rows 76 cols
[2024-05-20 16:51:59] [INFO ] Computed 10 invariants in 4 ms
[2024-05-20 16:51:59] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-20 16:51:59] [INFO ] Invariant cache hit.
[2024-05-20 16:51:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-20 16:51:59] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 76/105 places, 172/200 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1192 ms. Remains : 76/105 places, 172/200 transitions.
Initial state reduction rules removed 4 formulas.
RANDOM walk for 40000 steps (8 resets) in 3443 ms. (11 steps per ms) remains 3/168 properties
BEST_FIRST walk for 40002 steps (8 resets) in 165 ms. (240 steps per ms) remains 1/3 properties
BEST_FIRST walk for 1363 steps (0 resets) in 8 ms. (151 steps per ms) remains 0/1 properties
[2024-05-20 16:52:01] [INFO ] Flatten gal took : 90 ms
[2024-05-20 16:52:01] [INFO ] Flatten gal took : 47 ms
[2024-05-20 16:52:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality553303123887838629.gal : 20 ms
[2024-05-20 16:52:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2965514917129931025.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality553303123887838629.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2965514917129931025.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 172 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 105/105 places, 200/200 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 105 transition count 188
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 188
Applied a total of 24 rules in 14 ms. Remains 93 /105 variables (removed 12) and now considering 188/200 (removed 12) transitions.
// Phase 1: matrix 188 rows 93 cols
[2024-05-20 16:52:01] [INFO ] Computed 11 invariants in 4 ms
[2024-05-20 16:52:01] [INFO ] Implicit Places using invariants in 261 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 263 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 92/105 places, 188/200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 92 transition count 172
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 76 transition count 172
Applied a total of 32 rules in 4 ms. Remains 76 /92 variables (removed 16) and now considering 172/188 (removed 16) transitions.
// Phase 1: matrix 172 rows 76 cols
[2024-05-20 16:52:01] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 16:52:01] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-20 16:52:01] [INFO ] Invariant cache hit.
[2024-05-20 16:52:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-20 16:52:02] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 76/105 places, 172/200 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 943 ms. Remains : 76/105 places, 172/200 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:52:02] [INFO ] Flatten gal took : 39 ms
[2024-05-20 16:52:02] [INFO ] Flatten gal took : 28 ms
[2024-05-20 16:52:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6235016773363600829.gal : 9 ms
[2024-05-20 16:52:02] [INFO ] Time to serialize properties into /tmp/CTLFireability5861465372165925282.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/CTLFireability6235016773363600829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5861465372165925282.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 -...283
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,10401,1.52717,40156,2,9471,5,106009,6,0,479,73564,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 16:52:05] [INFO ] Flatten gal took : 16 ms
[2024-05-20 16:52:05] [INFO ] Applying decomposition
[2024-05-20 16:52:05] [INFO ] Flatten gal took : 15 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/graph9475986352843318243.txt' '-o' '/tmp/graph9475986352843318243.bin' '-w' '/tmp/graph9475986352843318243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9475986352843318243.bin' '-l' '-1' '-v' '-w' '/tmp/graph9475986352843318243.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:52:05] [INFO ] Decomposing Gal with order
[2024-05-20 16:52:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:52:05] [INFO ] Removed a total of 242 redundant transitions.
[2024-05-20 16:52:05] [INFO ] Flatten gal took : 125 ms
[2024-05-20 16:52:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 55 ms.
[2024-05-20 16:52:05] [INFO ] Time to serialize gal into /tmp/CTLFireability3522436040751877124.gal : 26 ms
[2024-05-20 16:52:05] [INFO ] Time to serialize properties into /tmp/CTLFireability7200844754023064636.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/CTLFireability3522436040751877124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7200844754023064636.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.
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,10401,1.43479,30608,1509,675,40690,4741,412,57118,148,98973,0


Converting to forward existential form...Done !
original formula: AG(EF(((((i1.u1.slot_T.F.F.F==1)&&(u2.next_0==1))&&((u5.ncs_0_0==1)&&(i1.u1.ncs_1_0==1)))&&((i1.u1.ncs_2_0==1)&&(u5.ncs_3_0==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i1.u1.slot_T.F.F.F==1)&&(u2.next_0==1))&&((u5.ncs_0_0==1)&&(i1.u1.ncs_1_0==1)...209
Reverse transition relation is NOT exact ! Due to transitions ncs_to_p1_0_1_0, ncs_to_p1_0_1_1, ncs_to_p1_0_1_2, ncs_to_p1_0_2_3, ncs_to_p1_0_2_5, ncs_to_p...2963
(forward)formula 0,0,2.1785,40904,1,0,56911,25664,1651,76101,687,152052,198578
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-20 16:52:08] [INFO ] Flatten gal took : 19 ms
[2024-05-20 16:52:08] [INFO ] Flatten gal took : 19 ms
[2024-05-20 16:52:08] [INFO ] Time to serialize gal into /tmp/CTLFireability12636911021982428957.gal : 3 ms
[2024-05-20 16:52:08] [INFO ] Time to serialize properties into /tmp/CTLFireability16039279216010928371.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/CTLFireability12636911021982428957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16039279216010928371.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 172 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,10401,1.5171,40344,2,9471,5,106009,6,0,479,73564,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-20 16:52:11] [INFO ] Flatten gal took : 17 ms
[2024-05-20 16:52:11] [INFO ] Applying decomposition
[2024-05-20 16:52:11] [INFO ] Flatten gal took : 22 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/graph3535219513975849893.txt' '-o' '/tmp/graph3535219513975849893.bin' '-w' '/tmp/graph3535219513975849893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3535219513975849893.bin' '-l' '-1' '-v' '-w' '/tmp/graph3535219513975849893.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:52:11] [INFO ] Decomposing Gal with order
[2024-05-20 16:52:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:52:11] [INFO ] Removed a total of 256 redundant transitions.
[2024-05-20 16:52:11] [INFO ] Flatten gal took : 54 ms
[2024-05-20 16:52:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 9 ms.
[2024-05-20 16:52:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14040718544733704988.gal : 16 ms
[2024-05-20 16:52:11] [INFO ] Time to serialize properties into /tmp/CTLFireability15229706602359818142.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/CTLFireability14040718544733704988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15229706602359818142.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 172 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,10401,1.17051,34672,1618,578,37057,7667,456,79673,142,138479,0


Converting to forward existential form...Done !
original formula: AG(EF(((i1.u2.next_0==1)&&(i0.u1.ncs_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.next_0==1)&&(i0.u1.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...2819
(forward)formula 0,1,2.76869,66352,1,0,98280,23677,1761,163020,705,215023,314519
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-20 16:52:14] [INFO ] Flatten gal took : 14 ms
[2024-05-20 16:52:14] [INFO ] Flatten gal took : 17 ms
[2024-05-20 16:52:14] [INFO ] Time to serialize gal into /tmp/CTLFireability13734793265299997704.gal : 3 ms
[2024-05-20 16:52:14] [INFO ] Time to serialize properties into /tmp/CTLFireability16660398184924159505.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/CTLFireability13734793265299997704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16660398184924159505.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 171 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,10401,1.46509,40416,2,9471,5,106009,6,0,479,73564,0


Converting to forward existential form...Done !
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
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...3298
(forward)formula 0,1,9.30757,224532,1,0,520,1.49182e+06,365,208,4092,421677,437
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 1,1,10.9519,261424,1,0,556,1.75192e+06,366,230,4094,486952,493
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 2,1,12.1487,300692,1,0,595,2.03207e+06,367,254,4096,560737,554
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 3,1,13.0666,329576,1,0,638,2.22678e+06,368,279,4098,608545,620
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 4,1,13.3017,336176,1,0,680,2.26554e+06,369,302,4100,622350,681
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 5,1,14.3303,345812,1,0,736,2.33638e+06,370,335,4102,642966,767
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 6,1,17.4964,423748,1,0,800,3.12259e+06,371,374,4105,829084,868
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 7,1,18.36,439324,1,0,840,3.25521e+06,372,398,4106,864211,929
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 8,1,21.0636,492516,1,0,896,3.64957e+06,373,433,4107,968121,1020
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 9,1,21.6217,511260,1,0,929,3.77455e+06,374,453,4108,1.00114e+06,1071
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 10,1,22.0449,524988,1,0,972,3.87402e+06,375,478,4109,1.02565e+06,1137
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 11,1,22.7423,548416,1,0,1024,4.03092e+06,376,509,4110,1.06655e+06,1218
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 12,1,23.1197,557656,1,0,1080,4.10615e+06,377,542,4111,1.08817e+06,1304
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 13,1,26.2618,647676,1,0,1141,4.77448e+06,378,579,4113,1.245e+06,1400
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 14,1,26.8709,663516,1,0,1178,4.89272e+06,379,601,4114,1.27444e+06,1456
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 15,1,27.5302,682456,1,0,1216,5.01272e+06,380,624,4115,1.3048e+06,1517
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 16,1,28.5048,704104,1,0,1249,5.166e+06,381,644,4116,1.34319e+06,1568
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-20 16:52:44] [INFO ] Flatten gal took : 14 ms
[2024-05-20 16:52:44] [INFO ] Applying decomposition
[2024-05-20 16:52:44] [INFO ] Flatten gal took : 13 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/graph8974778808999077277.txt' '-o' '/tmp/graph8974778808999077277.bin' '-w' '/tmp/graph8974778808999077277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8974778808999077277.bin' '-l' '-1' '-v' '-w' '/tmp/graph8974778808999077277.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:52:44] [INFO ] Decomposing Gal with order
[2024-05-20 16:52:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:52:44] [INFO ] Removed a total of 237 redundant transitions.
[2024-05-20 16:52:44] [INFO ] Flatten gal took : 57 ms
[2024-05-20 16:52:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 5 ms.
[2024-05-20 16:52:44] [INFO ] Time to serialize gal into /tmp/CTLFireability18128399857688344392.gal : 13 ms
[2024-05-20 16:52:44] [INFO ] Time to serialize properties into /tmp/CTLFireability3351646994140569703.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/CTLFireability18128399857688344392.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3351646994140569703.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 154 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,10401,1.29284,38060,1676,751,45390,6850,419,78061,135,175123,0


Converting to forward existential form...Done !
original formula: AG(EF(((u6.next_4==1)&&(u4.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_4==1)&&(u4.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_3, ncs_to_p1_0_0_4, ncs_to_p1_0_0_5, ncs_to_p...3003
(forward)formula 0,1,3.11514,69936,1,0,106490,30014,1627,126299,645,213165,405955
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(u4.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(u4.ncs_0_2==1)))))] = FALSE
(forward)formula 1,1,3.43596,76536,1,0,116971,30126,1631,134753,646,214191,442722
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(u4.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(u4.ncs_0_2==1)))))] = FALSE
(forward)formula 2,1,3.72407,83664,1,0,129542,30257,1634,145255,646,216198,486168
Formula is TRUE !

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

original formula: AG(EF(((u3.next_0==1)&&(u4.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_0==1)&&(u4.ncs_0_3==1)))))] = FALSE
(forward)formula 3,1,4.4643,104256,1,0,166798,30751,1639,174012,647,226237,613406
Formula is TRUE !

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

original formula: AG(EF(((u3.next_1==1)&&(u4.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_1==1)&&(u4.ncs_0_3==1)))))] = FALSE
(forward)formula 4,1,4.72918,111120,1,0,179497,30756,1643,183506,648,227015,657289
Formula is TRUE !

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

original formula: AG(EF(((u4.next_2==1)&&(u4.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_2==1)&&(u4.ncs_0_3==1)))))] = FALSE
(forward)formula 5,1,4.9663,116928,1,0,189319,30759,1648,191044,650,227258,691510
Formula is TRUE !

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

original formula: AG(EF(((u4.next_3==1)&&(u4.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_3==1)&&(u4.ncs_0_3==1)))))] = FALSE
(forward)formula 6,1,5.24462,123264,1,0,200433,30794,1654,200128,653,229212,730040
Formula is TRUE !

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

original formula: AG(EF(((u6.next_4==1)&&(u4.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_4==1)&&(u4.ncs_0_3==1)))))] = FALSE
(forward)formula 7,1,5.36433,125640,1,0,204628,30801,1656,204340,653,229312,743130
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(u4.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(u4.ncs_0_3==1)))))] = FALSE
(forward)formula 8,1,5.45373,127488,1,0,207935,30805,1658,206978,653,229381,753949
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(u4.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(u4.ncs_0_3==1)))))] = FALSE
(forward)formula 9,1,5.78508,131448,1,0,213761,30824,1660,211799,653,229522,772487
Formula is TRUE !

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

original formula: AG(EF(((u3.next_0==1)&&(u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_0==1)&&(u6.ncs_1_0==1)))))] = FALSE
(forward)formula 10,1,6.72402,152720,1,0,248812,31579,1664,242968,654,241388,892578
Formula is TRUE !

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

original formula: AG(EF(((u3.next_1==1)&&(u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_1==1)&&(u6.ncs_1_0==1)))))] = FALSE
(forward)formula 11,1,7.12458,161432,1,0,262989,31745,1666,254257,654,243630,944919
Formula is TRUE !

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

original formula: AG(EF(((u4.next_2==1)&&(u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_2==1)&&(u6.ncs_1_0==1)))))] = FALSE
(forward)formula 12,1,7.33136,165920,1,0,270353,31821,1668,259956,654,244229,971827
Formula is TRUE !

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

original formula: AG(EF(((u4.next_3==1)&&(u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_3==1)&&(u6.ncs_1_0==1)))))] = FALSE
(forward)formula 13,1,7.46244,169088,1,0,275758,31821,1670,263859,654,244581,990405
Formula is TRUE !

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

original formula: AG(EF(((u6.next_4==1)&&(u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_4==1)&&(u6.ncs_1_0==1)))))] = FALSE
(forward)formula 14,1,7.61585,171992,1,0,279959,31821,1674,267517,656,244636,1005100
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(u6.ncs_1_0==1)))))] = FALSE
(forward)formula 15,1,7.69416,173576,1,0,282543,31823,1678,269490,658,244694,1014359
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(u6.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(u6.ncs_1_0==1)))))] = FALSE
(forward)formula 16,1,7.8452,176480,1,0,286666,31869,1680,272846,658,244838,1028200
Formula is TRUE !

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

original formula: AG(EF(((u3.next_0==1)&&(u7.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_0==1)&&(u7.ncs_1_1==1)))))] = FALSE
(forward)formula 17,1,8.5309,192320,1,0,313604,32114,1683,295635,658,250306,1120358
Formula is TRUE !

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

original formula: AG(EF(((u3.next_1==1)&&(u7.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_1==1)&&(u7.ncs_1_1==1)))))] = FALSE
(forward)formula 18,1,8.69304,196280,1,0,321000,32124,1685,300854,658,250632,1146169
Formula is TRUE !

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

original formula: AG(EF(((u4.next_2==1)&&(u7.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_2==1)&&(u7.ncs_1_1==1)))))] = FALSE
(forward)formula 19,1,9.14472,204728,1,0,333678,32137,1687,310413,658,250759,1192361
Formula is TRUE !

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

original formula: AG(EF(((u4.next_3==1)&&(u7.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_3==1)&&(u7.ncs_1_1==1)))))] = FALSE
(forward)formula 20,1,9.28176,207896,1,0,339518,32148,1689,314395,658,250794,1214707
Formula is TRUE !

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

original formula: AG(EF(((u6.next_4==1)&&(u7.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_4==1)&&(u7.ncs_1_1==1)))))] = FALSE
(forward)formula 21,1,9.45411,211328,1,0,344733,32154,1691,318563,658,250817,1232371
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(u7.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(u7.ncs_1_1==1)))))] = FALSE
(forward)formula 22,1,9.68298,215552,1,0,350531,32154,1693,323112,658,250828,1251807
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(u7.ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(u7.ncs_1_1==1)))))] = FALSE
(forward)formula 23,1,9.89111,219248,1,0,356110,32180,1697,328043,660,251597,1269067
Formula is TRUE !

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

original formula: AG(EF(((u3.next_0==1)&&(i0.u1.ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_0==1)&&(i0.u1.ncs_1_2==1)))))] = FALSE
(forward)formula 24,1,10.5704,234296,1,0,384169,32344,1702,347809,661,252371,1370847
Formula is TRUE !

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

original formula: AG(EF(((u3.next_1==1)&&(i0.u1.ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_1==1)&&(i0.u1.ncs_1_2==1)))))] = FALSE
(forward)formula 25,1,10.7678,238520,1,0,391811,32365,1704,353603,661,252455,1401210
Formula is TRUE !

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

original formula: AG(EF(((u4.next_2==1)&&(i0.u1.ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_2==1)&&(i0.u1.ncs_1_2==1)))))] = FALSE
(forward)formula 26,1,10.9367,242216,1,0,397765,32375,1706,358235,661,252513,1426365
Formula is TRUE !

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

original formula: AG(EF(((u4.next_3==1)&&(i0.u1.ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_3==1)&&(i0.u1.ncs_1_2==1)))))] = FALSE
(forward)formula 27,1,11.0929,245120,1,0,402693,32382,1708,361864,661,252536,1445866
Formula is TRUE !

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

original formula: AG(EF(((u6.next_4==1)&&(i0.u1.ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_4==1)&&(i0.u1.ncs_1_2==1)))))] = FALSE
(forward)formula 28,1,11.3015,248816,1,0,407778,32382,1710,366054,661,252580,1465636
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(i0.u1.ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(i0.u1.ncs_1_2==1)))))] = FALSE
(forward)formula 29,1,11.5779,253304,1,0,414589,32428,1712,371466,661,252728,1490994
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(i0.u1.ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(i0.u1.ncs_1_2==1)))))] = FALSE
(forward)formula 30,1,12.0787,258848,1,0,422276,32457,1714,377609,661,252826,1520374
Formula is TRUE !

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

original formula: AG(EF(((u3.next_0==1)&&(i0.u8.ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_0==1)&&(i0.u8.ncs_1_3==1)))))] = FALSE
(forward)formula 31,1,12.7508,272840,1,0,446954,32470,1718,395752,661,253511,1602273
Formula is TRUE !

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

original formula: AG(EF(((u3.next_1==1)&&(i0.u8.ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_1==1)&&(i0.u8.ncs_1_3==1)))))] = FALSE
(forward)formula 32,1,13.008,278120,1,0,456139,32470,1720,402661,661,253616,1636312
Formula is TRUE !

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

original formula: AG(EF(((u4.next_2==1)&&(i0.u8.ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_2==1)&&(i0.u8.ncs_1_3==1)))))] = FALSE
(forward)formula 33,1,13.2299,282344,1,0,462960,32470,1722,408109,661,253661,1661619
Formula is TRUE !

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

original formula: AG(EF(((u4.next_3==1)&&(i0.u8.ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_3==1)&&(i0.u8.ncs_1_3==1)))))] = FALSE
(forward)formula 34,1,13.7487,292428,1,0,471107,32471,1724,414616,661,254019,1689970
Formula is TRUE !

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

original formula: AG(EF(((u6.next_4==1)&&(i0.u8.ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_4==1)&&(i0.u8.ncs_1_3==1)))))] = FALSE
(forward)formula 35,1,13.8347,293484,1,0,474096,32489,1726,417473,661,254099,1700410
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(i0.u8.ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(i0.u8.ncs_1_3==1)))))] = FALSE
(forward)formula 36,1,13.8943,294276,1,0,476523,32489,1728,419410,661,254099,1709140
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(i0.u8.ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(i0.u8.ncs_1_3==1)))))] = FALSE
(forward)formula 37,1,14.1637,295860,1,0,480679,32492,1730,422892,661,254102,1723522
Formula is TRUE !

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

original formula: AG(EF(((u3.next_0==1)&&(i1.u0.ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_0==1)&&(i1.u0.ncs_2_0==1)))))] = FALSE
(forward)formula 38,1,14.9521,313812,1,0,513695,32611,1734,448209,661,256692,1832394
Formula is TRUE !

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

original formula: AG(EF(((u3.next_1==1)&&(i1.u0.ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_1==1)&&(i1.u0.ncs_2_0==1)))))] = FALSE
(forward)formula 39,1,15.4204,322788,1,0,527260,32672,1736,459100,661,256953,1880137
Formula is TRUE !

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

original formula: AG(EF(((u4.next_2==1)&&(i1.u0.ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_2==1)&&(i1.u0.ncs_2_0==1)))))] = FALSE
(forward)formula 40,1,15.603,326484,1,0,533672,32683,1738,464269,661,257182,1903756
Formula is TRUE !

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

original formula: AG(EF(((u4.next_3==1)&&(i1.u0.ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_3==1)&&(i1.u0.ncs_2_0==1)))))] = FALSE
(forward)formula 41,1,15.7333,329388,1,0,538343,32692,1740,467984,661,257232,1920735
Formula is TRUE !

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

original formula: AG(EF(((u6.next_4==1)&&(i1.u0.ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_4==1)&&(i1.u0.ncs_2_0==1)))))] = FALSE
(forward)formula 42,1,15.8994,332292,1,0,542788,32696,1742,471500,661,257267,1938189
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(i1.u0.ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(i1.u0.ncs_2_0==1)))))] = FALSE
(forward)formula 43,1,15.9684,333612,1,0,544842,32715,1744,473063,661,257314,1945460
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(i1.u0.ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(i1.u0.ncs_2_0==1)))))] = FALSE
(forward)formula 44,1,16.1366,336780,1,0,550041,32717,1746,476873,661,257327,1963209
Formula is TRUE !

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

original formula: AG(EF(((u3.next_0==1)&&(i1.u2.ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_0==1)&&(i1.u2.ncs_2_1==1)))))] = FALSE
(forward)formula 45,1,16.9186,354732,1,0,582852,32846,1749,501264,661,259080,2075045
Formula is TRUE !

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

original formula: AG(EF(((u3.next_1==1)&&(i1.u2.ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_1==1)&&(i1.u2.ncs_2_1==1)))))] = FALSE
(forward)formula 46,1,17.1077,358956,1,0,591126,32863,1751,507336,661,259146,2106400
Formula is TRUE !

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

original formula: AG(EF(((u4.next_2==1)&&(i1.u2.ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_2==1)&&(i1.u2.ncs_2_1==1)))))] = FALSE
(forward)formula 47,1,17.4915,366084,1,0,601541,32867,1753,515966,661,259223,2146821
Formula is TRUE !

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

original formula: AG(EF(((u4.next_3==1)&&(i1.u2.ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_3==1)&&(i1.u2.ncs_2_1==1)))))] = FALSE
(forward)formula 48,1,17.6365,369252,1,0,606992,32873,1755,520029,661,259244,2168775
Formula is TRUE !

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

original formula: AG(EF(((u6.next_4==1)&&(i1.u2.ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_4==1)&&(i1.u2.ncs_2_1==1)))))] = FALSE
(forward)formula 49,1,17.8228,372684,1,0,612368,32887,1757,524379,661,259284,2190459
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(i1.u2.ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(i1.u2.ncs_2_1==1)))))] = FALSE
(forward)formula 50,1,18.0556,376908,1,0,618876,32887,1759,529526,661,259310,2215621
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(i1.u2.ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(i1.u2.ncs_2_1==1)))))] = FALSE
(forward)formula 51,1,18.4064,383772,1,0,630438,32890,1761,538367,661,259427,2253535
Formula is TRUE !

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

original formula: AG(EF(((u3.next_0==1)&&(u7.ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_0==1)&&(u7.ncs_2_2==1)))))] = FALSE
(forward)formula 52,1,18.9163,393276,1,0,646286,32957,1764,550337,661,259794,2314287
Formula is TRUE !

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

original formula: AG(EF(((u3.next_1==1)&&(u7.ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_1==1)&&(u7.ncs_2_2==1)))))] = FALSE
(forward)formula 53,1,19.0499,395652,1,0,649979,32983,1766,553496,661,260041,2328797
Formula is TRUE !

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

original formula: AG(EF(((u4.next_2==1)&&(u7.ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_2==1)&&(u7.ncs_2_2==1)))))] = FALSE
(forward)formula 54,1,19.176,397764,1,0,652824,32994,1768,555842,661,260090,2340611
Formula is TRUE !

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

original formula: AG(EF(((u4.next_3==1)&&(u7.ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_3==1)&&(u7.ncs_2_2==1)))))] = FALSE
(forward)formula 55,1,19.3282,400404,1,0,657346,32997,1770,558973,661,260121,2358589
Formula is TRUE !

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

original formula: AG(EF(((u6.next_4==1)&&(u7.ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_4==1)&&(u7.ncs_2_2==1)))))] = FALSE
(forward)formula 56,1,19.5356,403308,1,0,661297,32998,1772,562334,661,260157,2374135
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(u7.ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(u7.ncs_2_2==1)))))] = FALSE
(forward)formula 57,1,19.7746,406740,1,0,665435,32998,1774,565683,661,260287,2390144
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(u7.ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(u7.ncs_2_2==1)))))] = FALSE
(forward)formula 58,1,20.0783,411492,1,0,672859,32999,1778,571652,663,260485,2417391
Formula is TRUE !

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

original formula: AG(EF(((u3.next_0==1)&&(u9.ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_0==1)&&(u9.ncs_2_3==1)))))] = FALSE
(forward)formula 59,1,20.3182,415452,1,0,678240,32999,1781,576684,663,260507,2435096
Formula is TRUE !

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

original formula: AG(EF(((u3.next_1==1)&&(u9.ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_1==1)&&(u9.ncs_2_3==1)))))] = FALSE
(forward)formula 60,1,20.3749,416508,1,0,679816,32999,1783,578239,663,260507,2440803
Formula is TRUE !

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

original formula: AG(EF(((u4.next_2==1)&&(u9.ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_2==1)&&(u9.ncs_2_3==1)))))] = FALSE
(forward)formula 61,1,20.3922,416772,1,0,680054,32999,1785,578598,663,260544,2441534
Formula is TRUE !

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

original formula: AG(EF(((u4.next_3==1)&&(u9.ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_3==1)&&(u9.ncs_2_3==1)))))] = FALSE
(forward)formula 62,1,20.6055,420468,1,0,685650,32999,1787,583156,663,260572,2459935
Formula is TRUE !

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

original formula: AG(EF(((u6.next_4==1)&&(u9.ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_4==1)&&(u9.ncs_2_3==1)))))] = FALSE
(forward)formula 63,1,20.6563,421260,1,0,686549,33000,1789,583933,663,260578,2463306
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(u9.ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(u9.ncs_2_3==1)))))] = FALSE
(forward)formula 64,1,20.6969,421788,1,0,687310,33000,1791,584489,663,260578,2465947
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(u9.ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(u9.ncs_2_3==1)))))] = FALSE
(forward)formula 65,1,20.7489,422844,1,0,688724,33006,1793,585622,663,260590,2471568
Formula is TRUE !

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

original formula: AG(EF(((u3.next_0==1)&&(u6.ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_0==1)&&(u6.ncs_3_0==1)))))] = FALSE
(forward)formula 66,1,21.6363,439740,1,0,713524,34290,1796,615692,663,293640,2539639
Formula is TRUE !

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

original formula: AG(EF(((u3.next_1==1)&&(u6.ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_1==1)&&(u6.ncs_3_0==1)))))] = FALSE
(forward)formula 67,1,22.0689,446604,1,0,724619,34479,1798,624967,663,297166,2571218
Formula is TRUE !

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

original formula: AG(EF(((u4.next_2==1)&&(u6.ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_2==1)&&(u6.ncs_3_0==1)))))] = FALSE
(forward)formula 68,1,22.326,450828,1,0,731441,34580,1800,630343,663,298195,2590713
Formula is TRUE !

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

original formula: AG(EF(((u4.next_3==1)&&(u6.ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_3==1)&&(u6.ncs_3_0==1)))))] = FALSE
(forward)formula 69,1,22.4813,453732,1,0,735879,34660,1802,633997,663,299405,2603063
Formula is TRUE !

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

original formula: AG(EF(((u6.next_4==1)&&(u6.ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_4==1)&&(u6.ncs_3_0==1)))))] = FALSE
(forward)formula 70,1,22.6818,456636,1,0,740094,34660,1806,637474,665,299444,2616207
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(u6.ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(u6.ncs_3_0==1)))))] = FALSE
(forward)formula 71,1,22.7896,458484,1,0,742730,34660,1810,639620,667,299804,2624015
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(u6.ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(u6.ncs_3_0==1)))))] = FALSE
(forward)formula 72,1,23,461388,1,0,747107,34682,1812,643300,667,300348,2636942
Formula is TRUE !

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

original formula: AG(EF(((u3.next_0==1)&&(u6.ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_0==1)&&(u6.ncs_3_1==1)))))] = FALSE
(forward)formula 73,1,23.9281,478284,1,0,771565,35842,1815,675121,667,336789,2705741
Formula is TRUE !

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

original formula: AG(EF(((u3.next_1==1)&&(u6.ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_1==1)&&(u6.ncs_3_1==1)))))] = FALSE
(forward)formula 74,1,24.1747,482244,1,0,778488,35851,1817,680224,667,337404,2726844
Formula is TRUE !

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

original formula: AG(EF(((u4.next_2==1)&&(u6.ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_2==1)&&(u6.ncs_3_1==1)))))] = FALSE
(forward)formula 75,1,24.6976,489108,1,0,788254,35929,1819,687746,667,339507,2753717
Formula is TRUE !

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

original formula: AG(EF(((u4.next_3==1)&&(u6.ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_3==1)&&(u6.ncs_3_1==1)))))] = FALSE
(forward)formula 76,1,24.8724,492012,1,0,793078,35929,1821,691109,667,339585,2769394
Formula is TRUE !

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

original formula: AG(EF(((u6.next_4==1)&&(u6.ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_4==1)&&(u6.ncs_3_1==1)))))] = FALSE
(forward)formula 77,1,25.1282,495444,1,0,798040,35929,1825,695028,669,339617,2785678
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(u6.ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(u6.ncs_3_1==1)))))] = FALSE
(forward)formula 78,1,25.4805,499932,1,0,804148,35946,1829,699911,671,339919,2804343
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(u6.ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(u6.ncs_3_1==1)))))] = FALSE
(forward)formula 79,1,25.7829,504156,1,0,809732,36095,1831,705819,671,343445,2820913
Formula is TRUE !

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

original formula: AG(EF(((u3.next_0==1)&&(u6.ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_0==1)&&(u6.ncs_3_2==1)))))] = FALSE
(forward)formula 80,1,26.485,516036,1,0,827458,36859,1834,728330,671,372460,2870317
Formula is TRUE !

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

original formula: AG(EF(((u3.next_1==1)&&(u6.ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_1==1)&&(u6.ncs_3_2==1)))))] = FALSE
(forward)formula 81,1,26.7239,519468,1,0,833076,36867,1836,732534,671,372805,2887575
Formula is TRUE !

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

original formula: AG(EF(((u4.next_2==1)&&(u6.ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_2==1)&&(u6.ncs_3_2==1)))))] = FALSE
(forward)formula 82,1,26.9178,522108,1,0,837590,36868,1838,735856,671,372865,2902046
Formula is TRUE !

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

original formula: AG(EF(((u4.next_3==1)&&(u6.ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_3==1)&&(u6.ncs_3_2==1)))))] = FALSE
(forward)formula 83,1,27.5398,525276,1,0,841426,36868,1840,738692,671,372908,2915067
Formula is TRUE !

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

original formula: AG(EF(((u6.next_4==1)&&(u6.ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_4==1)&&(u6.ncs_3_2==1)))))] = FALSE
(forward)formula 84,1,27.7858,528180,1,0,845601,36869,1844,742203,673,372982,2928794
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(u6.ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(u6.ncs_3_2==1)))))] = FALSE
(forward)formula 85,1,28.1142,532404,1,0,850924,36878,1848,746715,675,373145,2946119
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(u6.ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(u6.ncs_3_2==1)))))] = FALSE
(forward)formula 86,1,28.4596,536628,1,0,856516,36904,1850,752039,675,374487,2963087
Formula is TRUE !

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

original formula: AG(EF(((u3.next_0==1)&&(u5.ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_0==1)&&(u5.ncs_3_3==1)))))] = FALSE
(forward)formula 87,1,28.8942,544812,1,0,870902,36906,1853,761563,675,374564,2999985
Formula is TRUE !

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

original formula: AG(EF(((u3.next_1==1)&&(u5.ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u3.next_1==1)&&(u5.ncs_3_3==1)))))] = FALSE
(forward)formula 88,1,29.055,547980,1,0,877149,36906,1855,765579,675,374568,3016972
Formula is TRUE !

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

original formula: AG(EF(((u4.next_2==1)&&(u5.ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_2==1)&&(u5.ncs_3_3==1)))))] = FALSE
(forward)formula 89,1,29.1964,550884,1,0,882269,36906,1857,769071,675,374599,3030807
Formula is TRUE !

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

original formula: AG(EF(((u4.next_3==1)&&(u5.ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u4.next_3==1)&&(u5.ncs_3_3==1)))))] = FALSE
(forward)formula 90,1,29.3741,554052,1,0,887853,36906,1859,772897,675,374630,3045561
Formula is TRUE !

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

original formula: AG(EF(((u6.next_4==1)&&(u5.ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_4==1)&&(u5.ncs_3_3==1)))))] = FALSE
(forward)formula 91,1,29.4488,555900,1,0,890761,36906,1861,775219,675,374630,3053536
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(u5.ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(u5.ncs_3_3==1)))))] = FALSE
(forward)formula 92,1,29.5095,557220,1,0,893209,36906,1863,777079,675,374630,3060911
Formula is TRUE !

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

original formula: AG(EF(((u7.next_6==1)&&(u5.ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_6==1)&&(u5.ncs_3_3==1)))))] = FALSE
(forward)formula 93,1,29.6275,559332,1,0,896999,36906,1865,780002,675,374630,3071404
Formula is TRUE !
Detected timeout of ITS tools.
[2024-05-20 16:53:14] [INFO ] Flatten gal took : 13 ms
[2024-05-20 16:53:14] [INFO ] Flatten gal took : 28 ms
[2024-05-20 16:53:14] [INFO ] Time to serialize gal into /tmp/CTLFireability3549697480339247445.gal : 2 ms
[2024-05-20 16:53:14] [INFO ] Time to serialize properties into /tmp/CTLFireability17379729044605939476.ctl : 2 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/CTLFireability3549697480339247445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17379729044605939476.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 60 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,10401,1.2792,40292,2,9471,5,106009,6,0,479,73564,0


Converting to forward existential form...Done !
original formula: AG(EF(((next_4==1)&&(p1_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(p1_0_3==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...3298
(forward)formula 0,1,8.61428,203456,1,0,500,1.33172e+06,365,196,4056,377162,407
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(p1_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(p1_0_3==1)))))] = FALSE
(forward)formula 1,1,9.90753,237180,1,0,546,1.59051e+06,366,223,4058,448467,478
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(p1_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(p1_0_3==1)))))] = FALSE
(forward)formula 2,1,11.3948,264636,1,0,595,1.80754e+06,367,251,4060,509497,549
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(p1_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(p1_0_3==1)))))] = FALSE
(forward)formula 3,1,12.0005,283840,1,0,651,1.9442e+06,368,283,4062,549041,630
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(p1_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(p1_1_3==1)))))] = FALSE
(forward)formula 4,1,15.6052,355676,1,0,686,2.58229e+06,369,305,4064,697280,686
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(p1_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(p1_1_3==1)))))] = FALSE
(forward)formula 5,1,16.5663,380424,1,0,730,2.79609e+06,370,331,4065,759041,752
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(p1_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(p1_1_3==1)))))] = FALSE
(forward)formula 6,1,17.2839,398308,1,0,779,2.94852e+06,371,359,4066,805537,823
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(p1_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(p1_1_3==1)))))] = FALSE
(forward)formula 7,1,17.801,409132,1,0,835,3.0506e+06,372,391,4067,837376,904
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(p1_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(p1_2_3==1)))))] = FALSE
(forward)formula 8,1,21.7339,482848,1,0,870,3.64516e+06,373,413,4069,976359,960
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(p1_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(p1_2_3==1)))))] = FALSE
(forward)formula 9,1,22.6296,511556,1,0,914,3.84884e+06,374,439,4070,1.03473e+06,1026
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(p1_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(p1_2_3==1)))))] = FALSE
(forward)formula 10,1,23.2849,531816,1,0,963,3.99591e+06,375,467,4071,1.07924e+06,1097
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(p1_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(p1_2_3==1)))))] = FALSE
(forward)formula 11,1,23.7442,543696,1,0,1019,4.09475e+06,376,499,4072,1.11003e+06,1178
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(p1_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(p1_3_3==1)))))] = FALSE
(forward)formula 12,1,26.1693,614548,1,0,1054,4.63157e+06,377,521,4074,1.2359e+06,1234
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(p1_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(p1_3_3==1)))))] = FALSE
(forward)formula 13,1,27.141,640616,1,0,1098,4.82193e+06,378,547,4075,1.29001e+06,1300
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(p1_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(p1_3_3==1)))))] = FALSE
(forward)formula 14,1,27.8639,657512,1,0,1147,4.96121e+06,379,575,4076,1.3318e+06,1371
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(p1_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(p1_3_3==1)))))] = FALSE
(forward)formula 15,1,28.3827,670908,1,0,1203,5.05689e+06,380,607,4077,1.36141e+06,1452
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.F.T==1)&&(p2_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.F.T==1)&&(p2_0_3==1)))))] = FALSE
(forward)formula 16,1,29.3793,696976,1,0,1256,5.25271e+06,381,638,4080,1.40928e+06,1533
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.F.T==1)&&(p2_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.F.T==1)&&(p2_1_3==1)))))] = FALSE
(forward)formula 17,1,31.8068,726800,1,0,1309,5.41576e+06,382,669,4082,1.45263e+06,1614
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.F.T==1)&&(p2_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.F.T==1)&&(p2_2_3==1)))))] = FALSE
(forward)formula 18,1,32.4245,728848,1,0,1362,5.55921e+06,383,700,4084,1.49274e+06,1695
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.F.T==1)&&(p2_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.F.T==1)&&(p2_3_3==1)))))] = FALSE
(forward)formula 19,1,32.9491,732208,1,0,1415,5.67901e+06,384,731,4086,1.52886e+06,1776
Formula is TRUE !

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

original formula: AG(EF(((slot_T.F.F.F==1)&&(p3_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_T.F.F.F==1)&&(p3_0_0==1)))))] = FALSE
(forward)formula 20,1,35.1061,782496,1,0,1468,6.1437e+06,385,763,4089,1.64239e+06,1857
Formula is TRUE !

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

original formula: AG(EF(((slot_F.T.F.F==1)&&(p3_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.T.F.F==1)&&(p3_0_1==1)))))] = FALSE
(forward)formula 21,1,37.4465,823348,1,0,1521,6.51908e+06,386,796,4092,1.7353e+06,1943
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.T.F==1)&&(p3_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.T.F==1)&&(p3_0_2==1)))))] = FALSE
(forward)formula 22,1,41.4952,868748,1,0,1572,6.89015e+06,387,829,4095,1.83e+06,2029
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.F.T==1)&&(p3_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.F.T==1)&&(p3_0_3==1)))))] = FALSE
(forward)formula 23,1,41.509,869012,1,0,1608,6.89164e+06,388,849,4097,1.83266e+06,2080
Formula is TRUE !

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

original formula: AG(EF(((slot_T.F.F.F==1)&&(p3_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_T.F.F.F==1)&&(p3_1_0==1)))))] = FALSE
(forward)formula 24,1,43.1243,916992,1,0,1661,7.29682e+06,389,881,4099,1.93195e+06,2161
Formula is TRUE !

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

original formula: AG(EF(((slot_F.T.F.F==1)&&(p3_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.T.F.F==1)&&(p3_1_1==1)))))] = FALSE
(forward)formula 25,1,44.4487,958832,1,0,1714,7.61347e+06,390,914,4101,2.00992e+06,2247
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.T.F==1)&&(p3_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.T.F==1)&&(p3_1_2==1)))))] = FALSE
(forward)formula 26,1,45.9195,1002324,1,0,1765,7.95415e+06,391,947,4103,2.0954e+06,2333
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.F.T==1)&&(p3_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.F.T==1)&&(p3_1_3==1)))))] = FALSE
(forward)formula 27,1,45.9307,1002588,1,0,1801,7.95519e+06,392,967,4105,2.09748e+06,2384
Formula is TRUE !

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

original formula: AG(EF(((slot_T.F.F.F==1)&&(p3_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_T.F.F.F==1)&&(p3_2_0==1)))))] = FALSE
(forward)formula 28,1,47.5354,1049512,1,0,1854,8.33805e+06,393,999,4107,2.19075e+06,2465
Formula is TRUE !

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

original formula: AG(EF(((slot_F.T.F.F==1)&&(p3_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.T.F.F==1)&&(p3_2_1==1)))))] = FALSE
(forward)formula 29,1,48.8588,1088828,1,0,1907,8.63077e+06,394,1032,4109,2.26353e+06,2551
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.T.F==1)&&(p3_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.T.F==1)&&(p3_2_2==1)))))] = FALSE
(forward)formula 30,1,50.3155,1132780,1,0,1958,8.95213e+06,395,1065,4111,2.34431e+06,2637
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.F.T==1)&&(p3_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.F.T==1)&&(p3_2_3==1)))))] = FALSE
(forward)formula 31,1,50.322,1133044,1,0,1994,8.95255e+06,396,1085,4113,2.34566e+06,2688
Formula is TRUE !

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

original formula: AG(EF(((slot_T.F.F.F==1)&&(p3_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_T.F.F.F==1)&&(p3_3_0==1)))))] = FALSE
(forward)formula 32,1,51.8793,1175480,1,0,2047,9.30383e+06,397,1117,4115,2.43083e+06,2769
Formula is TRUE !

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

original formula: AG(EF(((slot_F.T.F.F==1)&&(p3_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.T.F.F==1)&&(p3_3_1==1)))))] = FALSE
(forward)formula 33,1,53.1028,1209468,1,0,2100,9.56755e+06,398,1150,4117,2.49671e+06,2855
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.T.F==1)&&(p3_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.T.F==1)&&(p3_3_2==1)))))] = FALSE
(forward)formula 34,1,54.5607,1247680,1,0,2151,9.86516e+06,399,1183,4119,2.57223e+06,2941
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.F.T==1)&&(p3_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.F.T==1)&&(p3_3_3==1)))))] = FALSE
(forward)formula 35,1,54.5659,1247944,1,0,2187,9.86541e+06,400,1203,4121,2.57316e+06,2992
Formula is TRUE !

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

original formula: AG(EF(((slot_T.F.F.F==1)&&(p1_0_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_T.F.F.F==1)&&(p1_0_0==1)))))] = FALSE
(forward)formula 36,1,55.361,1270580,1,0,2237,1.00418e+07,401,1233,4123,2.61464e+06,3068
Formula is TRUE !

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

original formula: AG(EF(((slot_T.F.F.F==1)&&(p1_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_T.F.F.F==1)&&(p1_0_4==1)))))] = FALSE
(forward)formula 37,1,56.9364,1311696,1,0,2311,1.03642e+07,402,1271,4125,2.68984e+06,3164
Formula is TRUE !

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

original formula: AG(EF(((slot_F.T.F.F==1)&&(p1_0_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.T.F.F==1)&&(p1_0_1==1)))))] = FALSE
(forward)formula 38,1,57.1773,1318032,1,0,2361,1.04077e+07,403,1302,4127,2.70435e+06,3245
Formula is TRUE !

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

original formula: AG(EF(((slot_F.T.F.F==1)&&(p1_0_5==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.T.F.F==1)&&(p1_0_5==1)))))] = FALSE
(forward)formula 39,1,58.4387,1350700,1,0,2437,1.06487e+07,404,1343,4129,2.77272e+06,3351
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.T.F==1)&&(p1_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.T.F==1)&&(p1_0_2==1)))))] = FALSE
(forward)formula 40,1,58.5073,1352548,1,0,2487,1.06556e+07,405,1376,4131,2.77784e+06,3437
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.T.F==1)&&(p1_0_6==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.T.F==1)&&(p1_0_6==1)))))] = FALSE
(forward)formula 41,1,59.098,1368056,1,0,2566,1.07564e+07,406,1421,4133,2.80959e+06,3553
Formula is TRUE !

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

original formula: AG(EF(((slot_T.F.F.F==1)&&(p1_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_T.F.F.F==1)&&(p1_1_0==1)))))] = FALSE
(forward)formula 42,1,59.8948,1387328,1,0,2616,1.0914e+07,407,1451,4135,2.84712e+06,3629
Formula is TRUE !

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

original formula: AG(EF(((slot_T.F.F.F==1)&&(p1_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_T.F.F.F==1)&&(p1_1_4==1)))))] = FALSE
(forward)formula 43,1,61.6036,1429236,1,0,2690,1.12332e+07,408,1489,4137,2.92335e+06,3725
Formula is TRUE !

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

original formula: AG(EF(((slot_F.T.F.F==1)&&(p1_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.T.F.F==1)&&(p1_1_1==1)))))] = FALSE
(forward)formula 44,1,61.8052,1433988,1,0,2738,1.12633e+07,409,1519,4139,2.93399e+06,3801
Formula is TRUE !

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

original formula: AG(EF(((slot_F.T.F.F==1)&&(p1_1_5==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.T.F.F==1)&&(p1_1_5==1)))))] = FALSE
(forward)formula 45,1,63.0996,1465336,1,0,2814,1.14822e+07,410,1560,4141,2.99413e+06,3907
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.T.F==1)&&(p1_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.T.F==1)&&(p1_1_2==1)))))] = FALSE
(forward)formula 46,1,63.1664,1466920,1,0,2860,1.14879e+07,411,1590,4143,2.99877e+06,3984
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.T.F==1)&&(p1_1_6==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.T.F==1)&&(p1_1_6==1)))))] = FALSE
(forward)formula 47,1,66.7348,1496800,1,0,2939,1.15849e+07,412,1635,4145,3.02951e+06,4100
Formula is TRUE !

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

original formula: AG(EF(((slot_T.F.F.F==1)&&(p1_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_T.F.F.F==1)&&(p1_2_0==1)))))] = FALSE
(forward)formula 48,1,67.3209,1496800,1,0,2989,1.17216e+07,413,1665,4147,3.06314e+06,4176
Formula is TRUE !

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

original formula: AG(EF(((slot_T.F.F.F==1)&&(p1_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_T.F.F.F==1)&&(p1_2_4==1)))))] = FALSE
(forward)formula 49,1,68.6189,1498848,1,0,3063,1.20171e+07,414,1703,4149,3.13433e+06,4272
Formula is TRUE !

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

original formula: AG(EF(((slot_F.T.F.F==1)&&(p1_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.T.F.F==1)&&(p1_2_1==1)))))] = FALSE
(forward)formula 50,1,68.7609,1498848,1,0,3111,1.20448e+07,415,1733,4151,3.14428e+06,4348
Formula is TRUE !

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

original formula: AG(EF(((slot_F.T.F.F==1)&&(p1_2_5==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.T.F.F==1)&&(p1_2_5==1)))))] = FALSE
(forward)formula 51,1,69.6847,1517516,1,0,3187,1.22347e+07,416,1774,4153,3.19746e+06,4454
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.T.F==1)&&(p1_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.T.F==1)&&(p1_2_2==1)))))] = FALSE
(forward)formula 52,1,69.7198,1518308,1,0,3233,1.22373e+07,417,1804,4155,3.20054e+06,4531
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.T.F==1)&&(p1_2_6==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.T.F==1)&&(p1_2_6==1)))))] = FALSE
(forward)formula 53,1,70.2075,1530384,1,0,3312,1.23292e+07,418,1849,4157,3.22928e+06,4647
Formula is TRUE !

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

original formula: AG(EF(((slot_T.F.F.F==1)&&(p1_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_T.F.F.F==1)&&(p1_3_0==1)))))] = FALSE
(forward)formula 54,1,70.773,1542528,1,0,3362,1.24478e+07,419,1879,4159,3.25942e+06,4723
Formula is TRUE !

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

original formula: AG(EF(((slot_T.F.F.F==1)&&(p1_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_T.F.F.F==1)&&(p1_3_4==1)))))] = FALSE
(forward)formula 55,1,72.1296,1572292,1,0,3436,1.27215e+07,420,1917,4161,3.3264e+06,4819
Formula is TRUE !

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

original formula: AG(EF(((slot_F.T.F.F==1)&&(p1_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.T.F.F==1)&&(p1_3_1==1)))))] = FALSE
(forward)formula 56,1,72.281,1582124,1,0,3484,1.2747e+07,421,1947,4163,3.3357e+06,4895
Formula is TRUE !

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

original formula: AG(EF(((slot_F.T.F.F==1)&&(p1_3_5==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.T.F.F==1)&&(p1_3_5==1)))))] = FALSE
(forward)formula 57,1,74.1906,1599212,1,0,3560,1.29187e+07,422,1988,4165,3.38426e+06,5001
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.T.F==1)&&(p1_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.T.F==1)&&(p1_3_2==1)))))] = FALSE
(forward)formula 58,1,74.2147,1599740,1,0,3606,1.292e+07,423,2018,4167,3.38628e+06,5078
Formula is TRUE !

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

original formula: AG(EF(((slot_F.F.T.F==1)&&(p1_3_6==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((slot_F.F.T.F==1)&&(p1_3_6==1)))))] = FALSE
(forward)formula 59,1,74.669,1609244,1,0,3685,1.30055e+07,424,2063,4169,3.41299e+06,5194
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query Liveness after proving 173 properties.
FORMULA Liveness TRUE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE USE_NUPN
Total runtime 217095 ms.

BK_STOP 1716224070387

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

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