Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r008-oct2-177944369600099.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is Anderson-PT-05, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-oct2-177944369600099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 9.1K Mar 4 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 4 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 4 18:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Mar 4 18:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 15 07:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 4 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 4 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 4 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 4 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 185K Mar 3 18:30 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 1779653926970

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202604301425
[2026-05-24 20:18:49] [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]
[2026-05-24 20:18:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 20:18:49] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2026-05-24 20:18:49] [INFO ] Transformed 161 places.
[2026-05-24 20:18:49] [INFO ] Transformed 365 transitions.
[2026-05-24 20:18:49] [INFO ] Found NUPN structural information;
[2026-05-24 20:18:49] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 179 ms.
Built sparse matrix representations for Structural reductions in 13 ms.10725KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 161/161 places, 365/365 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 24 ms. Remains 161 /161 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 35 ms. Remains : 161/161 places, 365/365 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 161/161 places, 365/365 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 28 ms. Remains 161 /161 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3734713231531216593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7584353217169210643.kers'
[2026-05-24 20:18:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3734713231531216593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7584353217169210643.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 365 rows 161 cols 1330 entries
Finished phase 1 with 85 SingleSign rule and 63 generalized
[2026-05-24 20:18:49] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7584353217169210643.kers
Total runtime 5 ms.
[2026-05-24 20:18:49] [INFO ] Implicit Places using invariants in 262 ms returned []
[2026-05-24 20:18:49] [INFO ] Invariant cache hit.
[2026-05-24 20:18:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-24 20:18:50] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2026-05-24 20:18:50] [INFO ] Redundant transitions in 12 ms returned []
Running 360 sub problems to find dead transitions.
[2026-05-24 20:18:50] [INFO ] Invariant cache hit.
[2026-05-24 20:18:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 161/526 variables, and 209 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30037 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/161 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 35/209 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 161/526 variables, and 210 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30052 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/161 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/360 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60414ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 60436ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61298 ms. Remains : 161/161 places, 365/365 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1899 ms (no deadlock found). (steps per millisecond=658 )
Random directed walk for 1250000 steps, including 0 resets, run took 1640 ms (no deadlock found). (steps per millisecond=762 )
[2026-05-24 20:19:54] [INFO ] Invariant cache hit.
[2026-05-24 20:19:54] [INFO ] [Real]Absence check using 6 positive place invariants in 25 ms returned sat
[2026-05-24 20:19:54] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 285 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 161/161 places, 365/365 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 161 transition count 345
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 141 transition count 345
Applied a total of 40 rules in 41 ms. Remains 141 /161 variables (removed 20) and now considering 345/365 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6578534825886633315.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11365749638767919097.kers'
[2026-05-24 20:19:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6578534825886633315.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11365749638767919097.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 345 rows 141 cols 1290 entries
Finished phase 1 with 65 SingleSign rule and 63 generalized
[2026-05-24 20:19:54] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11365749638767919097.kers
Total runtime 2 ms.
[2026-05-24 20:19:56] [INFO ] Implicit Places using invariants in 1391 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1401 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 140/161 places, 345/365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 320
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 115 transition count 320
Applied a total of 50 rules in 10 ms. Remains 115 /140 variables (removed 25) and now considering 320/345 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18027742913905490666.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4781829532509007510.kers'
[2026-05-24 20:19:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18027742913905490666.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4781829532509007510.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 320 rows 115 cols 1190 entries
Finished phase 1 with 65 SingleSign rule and 38 generalized
[2026-05-24 20:19:56] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4781829532509007510.kers
Total runtime 1 ms.
[2026-05-24 20:19:56] [INFO ] Implicit Places using invariants in 582 ms returned []
[2026-05-24 20:19:56] [INFO ] Invariant cache hit.
[2026-05-24 20:19:57] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-24 20:19:57] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1646 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 115/161 places, 320/365 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 3103 ms. Remains : 115/161 places, 320/365 transitions.
Initial state reduction rules removed 5 formulas.
[2026-05-24 20:19:58] [INFO ] Flatten gal took : 136 ms
[2026-05-24 20:19:58] [INFO ] Flatten gal took : 61 ms
[2026-05-24 20:19:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17521353595621499615.gal : 29 ms
[2026-05-24 20:19:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15789984150828911565.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17521353595621499615.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15789984150828911565.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 20:20:09] [INFO ] Flatten gal took : 38 ms
[2026-05-24 20:20:09] [INFO ] Applying decomposition
[2026-05-24 20:20:10] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6303624807211057331.txt' '-o' '/tmp/graph6303624807211057331.bin' '-w' '/tmp/graph6303624807211057331.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6303624807211057331.bin' '-l' '-1' '-v' '-w' '/tmp/graph6303624807211057331.weights' '-q' '0' '-e' '0.001'
[2026-05-24 20:20:10] [INFO ] Decomposing Gal with order
[2026-05-24 20:20:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 20:20:10] [INFO ] Removed a total of 442 redundant transitions.
[2026-05-24 20:20:10] [INFO ] Flatten gal took : 111 ms
[2026-05-24 20:20:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 15 ms.
[2026-05-24 20:20:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9998526227824097977.gal : 5 ms
[2026-05-24 20:20:10] [INFO ] Time to serialize properties into /tmp/CTLFireability7931117763527686384.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9998526227824097977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7931117763527686384.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 20:20:13] [INFO ] Flatten gal took : 26 ms
[2026-05-24 20:20:13] [INFO ] Flatten gal took : 16 ms
[2026-05-24 20:20:13] [INFO ] Time to serialize gal into /tmp/CTLFireability12121080998360580490.gal : 2 ms
[2026-05-24 20:20:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3452935023728276845.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12121080998360580490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3452935023728276845.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 20:20:43] [INFO ] Flatten gal took : 35 ms
[2026-05-24 20:20:43] [INFO ] Applying decomposition
[2026-05-24 20:20:43] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7875681166519976370.txt' '-o' '/tmp/graph7875681166519976370.bin' '-w' '/tmp/graph7875681166519976370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7875681166519976370.bin' '-l' '-1' '-v' '-w' '/tmp/graph7875681166519976370.weights' '-q' '0' '-e' '0.001'
[2026-05-24 20:20:43] [INFO ] Decomposing Gal with order
[2026-05-24 20:20:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 20:20:43] [INFO ] Removed a total of 470 redundant transitions.
[2026-05-24 20:20:43] [INFO ] Flatten gal took : 30 ms
[2026-05-24 20:20:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 6 ms.
[2026-05-24 20:20:43] [INFO ] Time to serialize gal into /tmp/CTLFireability7893423208615030409.gal : 3 ms
[2026-05-24 20:20:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8901918911453885776.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7893423208615030409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8901918911453885776.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,184136,14.32,254604,5698,3050,244898,48293,662,998399,222,1.29597e+06,0


Converting to forward existential form...Done !
original formula: AG(EF(((((i4.u11.slot_T.F.F.F.F==1)&&(u3.next_0==1))&&((i4.u6.ncs_0_0==1)&&(i4.u11.ncs_1_0==1)))&&(((i4.u6.ncs_2_0==1)&&(i4.u11.ncs_3_0==...182
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i4.u11.slot_T.F.F.F.F==1)&&(u3.next_0==1))&&((i4.u6.ncs_0_0==1)&&(i4.u11.ncs_...242
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_4, ncs_to_p1_0_2_0, ncs_to_p...5174
(forward)formula 0,0,23.6547,348108,1,0,381920,241672,2635,1.38802e+06,1233,2.06004e+06,1063108
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 20:21:07] [INFO ] Flatten gal took : 15 ms
[2026-05-24 20:21:07] [INFO ] Flatten gal took : 14 ms
[2026-05-24 20:21:07] [INFO ] Time to serialize gal into /tmp/CTLFireability4140251735006470554.gal : 2 ms
[2026-05-24 20:21:07] [INFO ] Time to serialize properties into /tmp/CTLFireability6637940127556588472.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4140251735006470554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6637940127556588472.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 320 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 20:21:10] [INFO ] Flatten gal took : 39 ms
[2026-05-24 20:21:10] [INFO ] Applying decomposition
[2026-05-24 20:21:10] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12257163935225230617.txt' '-o' '/tmp/graph12257163935225230617.bin' '-w' '/tmp/graph12257163935225230617.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12257163935225230617.bin' '-l' '-1' '-v' '-w' '/tmp/graph12257163935225230617.weights' '-q' '0' '-e' '0.001'
[2026-05-24 20:21:10] [INFO ] Decomposing Gal with order
[2026-05-24 20:21:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 20:21:10] [INFO ] Removed a total of 538 redundant transitions.
[2026-05-24 20:21:10] [INFO ] Flatten gal took : 31 ms
[2026-05-24 20:21:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 10 ms.
[2026-05-24 20:21:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16606241015292823741.gal : 10 ms
[2026-05-24 20:21:10] [INFO ] Time to serialize properties into /tmp/CTLFireability11258066806163225872.ctl : 16 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16606241015292823741.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11258066806163225872.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 320 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 20:21:13] [INFO ] Flatten gal took : 25 ms
[2026-05-24 20:21:13] [INFO ] Flatten gal took : 19 ms
[2026-05-24 20:21:13] [INFO ] Time to serialize gal into /tmp/CTLFireability7386285928042294787.gal : 3 ms
[2026-05-24 20:21:13] [INFO ] Time to serialize properties into /tmp/CTLFireability546999733639993085.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7386285928042294787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability546999733639993085.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 20:21:43] [INFO ] Flatten gal took : 11 ms
[2026-05-24 20:21:43] [INFO ] Applying decomposition
[2026-05-24 20:21:43] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14770611300149373570.txt' '-o' '/tmp/graph14770611300149373570.bin' '-w' '/tmp/graph14770611300149373570.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14770611300149373570.bin' '-l' '-1' '-v' '-w' '/tmp/graph14770611300149373570.weights' '-q' '0' '-e' '0.001'
[2026-05-24 20:21:44] [INFO ] Decomposing Gal with order
[2026-05-24 20:21:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 20:21:44] [INFO ] Removed a total of 514 redundant transitions.
[2026-05-24 20:21:44] [INFO ] Flatten gal took : 27 ms
[2026-05-24 20:21:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 7 ms.
[2026-05-24 20:21:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5230116646165905057.gal : 3 ms
[2026-05-24 20:21:44] [INFO ] Time to serialize properties into /tmp/CTLFireability15755554630283725481.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5230116646165905057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15755554630283725481.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 320 CTL formulae.
Detected timeout of ITS tools.
[2026-05-24 20:22:14] [INFO ] Flatten gal took : 11 ms
[2026-05-24 20:22:14] [INFO ] Flatten gal took : 9 ms
[2026-05-24 20:22:14] [INFO ] Time to serialize gal into /tmp/CTLFireability11586349076475900749.gal : 2 ms
[2026-05-24 20:22:14] [INFO ] Time to serialize properties into /tmp/CTLFireability8109252638155730513.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11586349076475900749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8109252638155730513.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

original formula: AG(EF(((next_0==1)&&(ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_0_2==1)))))] = FALSE
(forward)formula 18,1,283.326,2724740,1,0,1039,2.1202e+07,14,420,2631,3.92365e+06,70
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 19,1,290.738,2724740,1,0,1039,2.1202e+07,15,420,2633,3.92365e+06,141
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 20,1,293.096,2724740,1,0,1039,2.1202e+07,16,420,2635,3.92365e+06,217
Formula is TRUE !
Detected timeout of ITS tools.
[2026-05-24 20:27:14] [INFO ] Flatten gal took : 10 ms
[2026-05-24 20:27:14] [INFO ] Applying decomposition
[2026-05-24 20:27:14] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3911385699283686925.txt' '-o' '/tmp/graph3911385699283686925.bin' '-w' '/tmp/graph3911385699283686925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3911385699283686925.bin' '-l' '-1' '-v' '-w' '/tmp/graph3911385699283686925.weights' '-q' '0' '-e' '0.001'
[2026-05-24 20:27:14] [INFO ] Decomposing Gal with order
[2026-05-24 20:27:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 20:27:14] [INFO ] Removed a total of 497 redundant transitions.
[2026-05-24 20:27:14] [INFO ] Flatten gal took : 28 ms
[2026-05-24 20:27:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 6 ms.
[2026-05-24 20:27:14] [INFO ] Time to serialize gal into /tmp/CTLFireability4835996917788043908.gal : 3 ms
[2026-05-24 20:27:14] [INFO ] Time to serialize properties into /tmp/CTLFireability15195290442223155655.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4835996917788043908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15195290442223155655.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 299 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,184136,39.0563,624464,6437,3319,453133,57837,656,3.27725e+06,227,3.00583e+06,0


Converting to forward existential form...Done !
original formula: AG(EF(((i2.u4.next_3==1)&&(u7.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u4.next_3==1)&&(u7.ncs_0_2==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions ncs_to_p1_0_1_1, ncs_to_p1_0_1_2, ncs_to_p1_0_1_3, ncs_to_p1_0_1_4, ncs_to_p1_0_1_5, ncs_to_p...5304
(forward)formula 0,1,73.9881,882716,1,0,926231,260750,2577,3.27725e+06,1168,5.72294e+06,2584363
Formula is TRUE !

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

original formula: AG(EF(((i2.u4.next_4==1)&&(u7.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u4.next_4==1)&&(u7.ncs_0_2==1)))))] = FALSE
(forward)formula 1,1,89.3097,1029076,1,0,1.06818e+06,267090,2582,3.27725e+06,1169,6.19694e+06,3004442
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(u7.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(u7.ncs_0_2==1)))))] = FALSE
(forward)formula 2,1,93.9088,1068724,1,0,1.11542e+06,267231,2586,3.27725e+06,1170,6.22889e+06,3139614
Formula is TRUE !

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

original formula: AG(EF(((u6.next_6==1)&&(u7.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_6==1)&&(u7.ncs_0_2==1)))))] = FALSE
(forward)formula 3,1,100.009,1109876,1,0,1.15908e+06,267425,2590,3.27725e+06,1171,6.24605e+06,3267199
Formula is TRUE !

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

original formula: AG(EF(((u7.next_7==1)&&(u7.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_7==1)&&(u7.ncs_0_2==1)))))] = FALSE
(forward)formula 4,1,107.843,1160892,1,0,1.1976e+06,269200,2596,3.27725e+06,1174,6.33183e+06,3374327
Formula is TRUE !

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

original formula: AG(EF(((u7.next_8==1)&&(u7.ncs_0_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_8==1)&&(u7.ncs_0_2==1)))))] = FALSE
(forward)formula 5,1,114.005,1184024,1,0,1.21945e+06,269570,2602,3.27725e+06,1177,6.38053e+06,3437007
Formula is TRUE !

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

original formula: AG(EF(((i1.u2.next_0==1)&&(u7.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.next_0==1)&&(u7.ncs_0_3==1)))))] = FALSE
(forward)formula 6,1,138.162,1443916,1,0,1.52289e+06,275627,2607,3.7681e+06,1177,7.16501e+06,4279839
Formula is TRUE !

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

original formula: AG(EF(((i1.u2.next_1==1)&&(u7.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.next_1==1)&&(u7.ncs_0_3==1)))))] = FALSE
(forward)formula 7,1,142.709,1494500,1,0,1.59423e+06,275682,2612,3.81619e+06,1178,7.17786e+06,4516332
Formula is TRUE !

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

original formula: AG(EF(((i2.u3.next_2==1)&&(u7.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u3.next_2==1)&&(u7.ncs_0_3==1)))))] = FALSE
(forward)formula 8,1,146.286,1522036,1,0,1.62251e+06,276113,2616,3.85035e+06,1178,7.23156e+06,4608849
Formula is TRUE !

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

original formula: AG(EF(((i2.u4.next_3==1)&&(u7.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u4.next_3==1)&&(u7.ncs_0_3==1)))))] = FALSE
(forward)formula 9,1,149.692,1546192,1,0,1.64944e+06,276129,2618,3.87105e+06,1178,7.25053e+06,4694926
Formula is TRUE !

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

original formula: AG(EF(((i2.u4.next_4==1)&&(u7.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u4.next_4==1)&&(u7.ncs_0_3==1)))))] = FALSE
(forward)formula 10,1,154.847,1580744,1,0,1.69334e+06,276145,2620,3.89827e+06,1178,7.26269e+06,4832159
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(u7.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(u7.ncs_0_3==1)))))] = FALSE
(forward)formula 11,1,159.836,1614480,1,0,1.73122e+06,276195,2622,3.92357e+06,1178,7.26551e+06,4939113
Formula is TRUE !

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

original formula: AG(EF(((u6.next_6==1)&&(u7.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_6==1)&&(u7.ncs_0_3==1)))))] = FALSE
(forward)formula 12,1,166.605,1654452,1,0,1.77136e+06,276290,2624,3.94951e+06,1178,7.26853e+06,5055269
Formula is TRUE !

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

original formula: AG(EF(((u7.next_7==1)&&(u7.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_7==1)&&(u7.ncs_0_3==1)))))] = FALSE
(forward)formula 13,1,175.152,1697976,1,0,1.80623e+06,276486,2628,3.981e+06,1180,7.29071e+06,5169420
Formula is TRUE !

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

original formula: AG(EF(((u7.next_8==1)&&(u7.ncs_0_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_8==1)&&(u7.ncs_0_3==1)))))] = FALSE
(forward)formula 14,1,183.812,1742060,1,0,1.83819e+06,276638,2632,4.01647e+06,1182,7.3416e+06,5268617
Formula is TRUE !

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

original formula: AG(EF(((i1.u2.next_0==1)&&(i2.u8.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.next_0==1)&&(i2.u8.ncs_0_4==1)))))] = FALSE
(forward)formula 15,1,204.425,1971688,1,0,2.11764e+06,283321,2637,4.4479e+06,1183,7.87548e+06,6044360
Formula is TRUE !

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

original formula: AG(EF(((i1.u2.next_1==1)&&(i2.u8.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.next_1==1)&&(i2.u8.ncs_0_4==1)))))] = FALSE
(forward)formula 16,1,210.636,2029828,1,0,2.19731e+06,283556,2639,4.50455e+06,1183,7.88449e+06,6276467
Formula is TRUE !

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

original formula: AG(EF(((i2.u3.next_2==1)&&(i2.u8.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u3.next_2==1)&&(i2.u8.ncs_0_4==1)))))] = FALSE
(forward)formula 17,1,216.659,2082516,1,0,2.26007e+06,283770,2643,4.5742e+06,1183,7.9226e+06,6464700
Formula is TRUE !

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

original formula: AG(EF(((i2.u4.next_3==1)&&(i2.u8.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u4.next_3==1)&&(i2.u8.ncs_0_4==1)))))] = FALSE
(forward)formula 18,1,222.481,2129916,1,0,2.31531e+06,283797,2647,4.63327e+06,1183,7.94351e+06,6627759
Formula is TRUE !

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

original formula: AG(EF(((i2.u4.next_4==1)&&(i2.u8.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i2.u4.next_4==1)&&(i2.u8.ncs_0_4==1)))))] = FALSE
(forward)formula 19,1,227.956,2184848,1,0,2.36256e+06,285393,2651,4.68242e+06,1183,8.01702e+06,6773586
Formula is TRUE !

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

original formula: AG(EF(((u6.next_5==1)&&(i2.u8.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_5==1)&&(i2.u8.ncs_0_4==1)))))] = FALSE
(forward)formula 20,1,229.995,2194476,1,0,2.38472e+06,285395,2653,4.69925e+06,1183,8.01911e+06,6833260
Formula is TRUE !

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

original formula: AG(EF(((u6.next_6==1)&&(i2.u8.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u6.next_6==1)&&(i2.u8.ncs_0_4==1)))))] = FALSE
(forward)formula 21,1,268.417,2200484,1,0,2.39544e+06,285430,1673,4.70576e+06,638,8.01918e+06,1601043
Formula is TRUE !

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

original formula: AG(EF(((u7.next_7==1)&&(i2.u8.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_7==1)&&(i2.u8.ncs_0_4==1)))))] = FALSE
(forward)formula 22,1,269.016,2200484,1,0,2.39544e+06,285430,1680,4.70576e+06,639,8.01918e+06,1674079
Formula is TRUE !

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

original formula: AG(EF(((u7.next_8==1)&&(i2.u8.ncs_0_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((u7.next_8==1)&&(i2.u8.ncs_0_4==1)))))] = FALSE
(forward)formula 23,1,272.165,2200484,1,0,2.39544e+06,285430,1684,4.70576e+06,640,8.01918e+06,1772771
Formula is TRUE !

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

original formula: AG(EF(((i1.u2.next_0==1)&&(i1.u1.ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i1.u2.next_0==1)&&(i1.u1.ncs_1_0==1)))))] = FALSE
(forward)formula 24,1,295.192,2200484,1,0,2.39544e+06,285430,1693,4.70576e+06,641,8.01918e+06,2931272
Formula is TRUE !
Detected timeout of ITS tools.
[2026-05-24 20:32:14] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:32:14] [INFO ] Flatten gal took : 7 ms
[2026-05-24 20:32:14] [INFO ] Time to serialize gal into /tmp/CTLFireability2235470776472404294.gal : 2 ms
[2026-05-24 20:32:14] [INFO ] Time to serialize properties into /tmp/CTLFireability3643597463033867384.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2235470776472404294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3643597463033867384.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(EF(((next_1==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_1_0==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions ncs_to_p1_0_0_0, ncs_to_p1_0_0_1, ncs_to_p1_0_0_2, ncs_to_p1_0_0_3, ncs_to_p1_0_0_4, ncs_to_p...6232
(forward)formula 0,1,76.9452,1752428,1,0,945,1.1222e+07,661,366,7010,2.74816e+06,758
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 1,1,85.0122,2005164,1,0,992,1.30476e+07,662,394,7012,3.0912e+06,829
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 2,1,124.086,2208000,1,0,1028,1.44534e+07,14,414,2631,3.35025e+06,75
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 3,1,131.227,2208000,1,0,1028,1.44534e+07,15,414,2633,3.35025e+06,151
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 4,1,135.456,2208000,1,0,1028,1.44534e+07,16,414,2635,3.35025e+06,232
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 5,1,136.718,2208000,1,0,1028,1.44534e+07,17,414,2637,3.35025e+06,303
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 6,1,137.119,2208000,1,0,1028,1.44534e+07,18,414,2639,3.35025e+06,379
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_1_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_1_0==1)))))] = FALSE
(forward)formula 7,1,138.735,2208000,1,0,1028,1.44534e+07,19,414,2641,3.35025e+06,495
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 8,1,160.176,2304328,1,0,1028,1.85592e+07,20,414,2644,3.46397e+06,616
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 9,1,196.474,2453464,1,0,1028,1.95224e+07,14,414,2631,3.63013e+06,95
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 10,1,204.362,2453464,1,0,1028,1.95224e+07,15,414,2633,3.63013e+06,176
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 11,1,209.722,2453464,1,0,1028,1.95224e+07,16,414,2635,3.63013e+06,247
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 12,1,213.14,2453464,1,0,1028,1.95224e+07,17,414,2637,3.63013e+06,313
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 13,1,216.411,2453464,1,0,1028,1.95224e+07,18,414,2639,3.63013e+06,394
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 14,1,221.292,2453464,1,0,1028,1.95224e+07,19,414,2641,3.63013e+06,490
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 15,1,221.788,2453464,1,0,1028,1.95224e+07,20,414,2643,3.63013e+06,566
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_1_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_1_1==1)))))] = FALSE
(forward)formula 16,1,223.091,2453464,1,0,1028,1.95224e+07,21,414,2645,3.63013e+06,682
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 17,1,266.386,2714372,1,0,1028,2.11692e+07,14,414,2631,3.8955e+06,65
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 18,1,274.257,2714372,1,0,1028,2.11692e+07,15,414,2633,3.8955e+06,137
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 19,1,276.347,2714372,1,0,1028,2.11692e+07,16,414,2635,3.8955e+06,213
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 20,1,283.729,2714372,1,0,1028,2.11692e+07,17,414,2637,3.8955e+06,329
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 21,1,286.152,2714372,1,0,1028,2.11692e+07,18,414,2639,3.8955e+06,395
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 22,1,288.548,2714372,1,0,1028,2.11692e+07,19,414,2641,3.8955e+06,476
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 23,1,290.537,2714372,1,0,1028,2.11692e+07,20,414,2643,3.8955e+06,572
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 24,1,294.123,2714372,1,0,1028,2.11692e+07,21,414,2645,3.8955e+06,683
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_1_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_1_2==1)))))] = FALSE
(forward)formula 25,1,295.153,2714372,1,0,1028,2.11692e+07,22,414,2647,3.8955e+06,799
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 26,1,314.816,2752216,1,0,1028,2.1549e+07,23,414,2649,4.01202e+06,920
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 27,1,320.548,2924596,1,0,1028,2.27064e+07,24,414,2650,4.21255e+06,991
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 28,1,355.966,2990212,1,0,1028,2.28695e+07,14,414,2631,4.23365e+06,130
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 29,1,357.972,2990212,1,0,1028,2.28695e+07,15,414,2633,4.23365e+06,206
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 30,1,360.209,2990212,1,0,1028,2.28695e+07,16,414,2635,4.23365e+06,272
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 31,1,362.337,2990212,1,0,1028,2.28695e+07,17,414,2637,4.23365e+06,353
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 32,1,363.614,2990212,1,0,1028,2.28695e+07,18,414,2639,4.23365e+06,449
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 33,1,365.452,2990212,1,0,1028,2.28695e+07,19,414,2641,4.23365e+06,560
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_1_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_1_3==1)))))] = FALSE
(forward)formula 34,1,368.32,2990212,1,0,1028,2.28695e+07,20,414,2643,4.23365e+06,676
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 35,1,382.696,2990212,1,0,1028,2.28695e+07,21,414,2646,4.23365e+06,787
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 36,1,387.619,2990212,1,0,1028,2.28695e+07,22,414,2648,4.23365e+06,858
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 37,1,391.387,2990212,1,0,1028,2.28695e+07,23,414,2649,4.23365e+06,929
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 38,1,394.396,2990212,1,0,1028,2.28695e+07,24,414,2650,4.23365e+06,1000
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 39,1,397.153,2992260,1,0,1028,2.32199e+07,25,416,2651,4.25571e+06,1071
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 40,1,399.415,2998404,1,0,1028,2.38507e+07,26,444,2652,4.37224e+06,1142
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 41,1,400.727,3000452,1,0,1028,2.42224e+07,27,472,2653,4.45423e+06,1213
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 42,1,401.158,3002500,1,0,1028,2.43322e+07,28,501,2654,4.48706e+06,1289
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_1_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_1_4==1)))))] = FALSE
(forward)formula 43,1,402.403,3004548,1,0,1028,2.46712e+07,29,548,2655,4.56343e+06,1410
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 44,1,453.992,3271532,1,0,1028,2.71097e+07,14,564,2631,4.95995e+06,90
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 45,1,460.295,3271532,1,0,1028,2.71097e+07,15,564,2633,4.95995e+06,156
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 46,1,464.595,3271532,1,0,1028,2.71097e+07,16,564,2635,4.95995e+06,227
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 47,1,468.155,3271532,1,0,1028,2.71097e+07,17,564,2637,4.95995e+06,298
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 48,1,470.69,3271532,1,0,1028,2.71097e+07,18,564,2639,4.95995e+06,364
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 49,1,473.713,3271532,1,0,1028,2.71097e+07,19,564,2641,4.95995e+06,445
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 50,1,474.72,3271532,1,0,1028,2.71097e+07,20,564,2643,4.95995e+06,516
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 51,1,475.054,3271532,1,0,1028,2.71097e+07,21,564,2645,4.95995e+06,592
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_2_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_2_0==1)))))] = FALSE
(forward)formula 52,1,476.091,3271532,1,0,1028,2.71097e+07,22,564,2647,4.95995e+06,708
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 53,1,494.115,3271532,1,0,1028,2.71097e+07,23,564,2649,4.95995e+06,829
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 54,1,498.124,3271532,1,0,1028,2.71097e+07,24,564,2650,4.95995e+06,900
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 55,1,506.966,3271532,1,0,1028,2.71097e+07,25,564,2651,4.95995e+06,981
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 56,1,512.407,3355876,1,0,1028,2.75687e+07,26,564,2652,5.15752e+06,1052
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 57,1,515.296,3449508,1,0,1028,2.83433e+07,27,564,2653,5.30894e+06,1118
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 58,1,518.228,3545844,1,0,1028,2.91169e+07,28,564,2654,5.44339e+06,1199
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 59,1,556.323,3609456,1,0,1028,2.96422e+07,14,564,2631,5.54114e+06,85
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 60,1,558.841,3609456,1,0,1028,2.96422e+07,15,564,2633,5.54114e+06,161
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_2_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_2_1==1)))))] = FALSE
(forward)formula 61,1,560.694,3609456,1,0,1028,2.96422e+07,16,564,2635,5.54114e+06,282
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 62,1,575.683,3609456,1,0,1028,2.96422e+07,17,564,2638,5.54114e+06,408
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 63,1,577.822,3609456,1,0,1028,2.96422e+07,18,564,2640,5.54114e+06,479
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 64,1,579.508,3609456,1,0,1028,2.96422e+07,19,564,2642,5.54114e+06,555
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 65,1,585.826,3609456,1,0,1028,2.96422e+07,20,564,2644,5.54114e+06,671
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 66,1,587.872,3609456,1,0,1028,2.96422e+07,21,564,2646,5.54114e+06,737
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 67,1,589.687,3609456,1,0,1028,2.96422e+07,22,564,2648,5.54114e+06,818
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 68,1,591.395,3609456,1,0,1028,2.96422e+07,23,564,2649,5.54114e+06,914
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 69,1,594.027,3609456,1,0,1028,2.96422e+07,24,564,2650,5.54114e+06,1025
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_2_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_2_2==1)))))] = FALSE
(forward)formula 70,1,594.933,3609456,1,0,1028,2.96422e+07,25,564,2651,5.54114e+06,1141
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 71,1,609.209,3609456,1,0,1028,2.96422e+07,26,564,2653,5.54114e+06,1262
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 72,1,612.036,3609456,1,0,1028,2.96422e+07,27,564,2654,5.54114e+06,1333
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 73,1,613.999,3609456,1,0,1028,2.96422e+07,28,564,2655,5.54114e+06,1404
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 74,1,616.025,3609456,1,0,1028,2.96422e+07,29,576,2656,5.54114e+06,1480
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 75,1,618.344,3609456,1,0,1028,2.96454e+07,30,602,2657,5.54114e+06,1546
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 76,1,620.486,3674440,1,0,1068,3.02932e+07,31,633,2658,5.59205e+06,1627
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 77,1,621.976,3720044,1,0,1133,3.07096e+07,32,670,2659,5.67776e+06,1723
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 78,1,624.707,3790808,1,0,1209,3.13672e+07,33,713,2660,5.81022e+06,1834
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_2_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_2_3==1)))))] = FALSE
(forward)formula 79,1,629.094,3887812,1,0,1288,3.22559e+07,34,758,2661,5.96305e+06,1950
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 80,1,672.931,3993860,1,0,1302,3.3075e+07,14,764,2631,6.08766e+06,100
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 81,1,677.083,3993860,1,0,1302,3.3075e+07,15,764,2633,6.08766e+06,171
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 82,1,680.142,3993860,1,0,1302,3.3075e+07,16,764,2635,6.08766e+06,242
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 83,1,682.646,3993860,1,0,1302,3.3075e+07,17,764,2637,6.08766e+06,313
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 84,1,684.673,3993860,1,0,1302,3.3075e+07,18,764,2639,6.08766e+06,384
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 85,1,686.382,3993860,1,0,1302,3.3075e+07,19,764,2641,6.08766e+06,455
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 86,1,687.329,3993860,1,0,1302,3.3075e+07,20,764,2643,6.08766e+06,526
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 87,1,687.65,3993860,1,0,1302,3.3075e+07,21,764,2645,6.08766e+06,602
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_2_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_2_4==1)))))] = FALSE
(forward)formula 88,1,688.528,3993860,1,0,1302,3.3075e+07,22,764,2647,6.08766e+06,723
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 89,1,704.365,3993860,1,0,1302,3.3075e+07,23,764,2649,6.08766e+06,849
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 90,1,710.403,3993860,1,0,1302,3.3075e+07,24,764,2650,6.08766e+06,915
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 91,1,715.428,3993860,1,0,1302,3.3075e+07,25,764,2651,6.08766e+06,986
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 92,1,719.524,3993860,1,0,1302,3.3075e+07,26,764,2652,6.08766e+06,1057
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 93,1,722.264,3993860,1,0,1302,3.3075e+07,27,764,2653,6.08766e+06,1123
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 94,1,725.628,3993860,1,0,1302,3.3075e+07,28,764,2654,6.08766e+06,1204
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 95,1,726.86,3993860,1,0,1302,3.3075e+07,29,764,2655,6.08766e+06,1275
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 96,1,727.248,3993860,1,0,1302,3.3075e+07,30,764,2656,6.08766e+06,1351
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_3_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_3_0==1)))))] = FALSE
(forward)formula 97,1,728.5,3993860,1,0,1302,3.3075e+07,31,764,2657,6.08766e+06,1467
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 98,1,747.013,4092956,1,0,1302,3.34303e+07,32,764,2659,6.26208e+06,1588
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 99,1,751.659,4244756,1,0,1302,3.463e+07,33,764,2660,6.47924e+06,1659
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 100,1,799.68,4404844,1,0,1302,3.59025e+07,14,764,2631,6.69908e+06,75
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 101,1,806.489,4404844,1,0,1302,3.59025e+07,15,764,2633,6.69908e+06,146
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 102,1,811.027,4404844,1,0,1302,3.59025e+07,16,764,2635,6.69908e+06,232
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 103,1,813.739,4404844,1,0,1302,3.59025e+07,17,764,2637,6.69908e+06,313
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 104,1,817.252,4404844,1,0,1302,3.59025e+07,18,764,2639,6.69908e+06,409
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 105,1,817.627,4404844,1,0,1302,3.59025e+07,19,764,2641,6.69908e+06,485
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_3_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_3_1==1)))))] = FALSE
(forward)formula 106,1,818.537,4404844,1,0,1302,3.59025e+07,20,764,2643,6.69908e+06,601
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 107,1,834.413,4404844,1,0,1302,3.59025e+07,21,764,2646,6.69908e+06,727
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 108,1,836.543,4404844,1,0,1302,3.59025e+07,22,764,2648,6.69908e+06,798
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 109,1,838.183,4404844,1,0,1302,3.59025e+07,23,764,2649,6.69908e+06,874
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 110,1,844.762,4404844,1,0,1302,3.59025e+07,24,764,2650,6.69908e+06,990
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 111,1,846.825,4404844,1,0,1302,3.59025e+07,25,764,2651,6.69908e+06,1056
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 112,1,848.741,4404844,1,0,1302,3.59025e+07,26,764,2652,6.69908e+06,1137
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 113,1,850.357,4404844,1,0,1302,3.59025e+07,27,764,2653,6.69908e+06,1233
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 114,1,853.059,4404844,1,0,1302,3.59025e+07,28,764,2654,6.69908e+06,1344
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_3_2==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_3_2==1)))))] = FALSE
(forward)formula 115,1,854.016,4404844,1,0,1302,3.59025e+07,29,764,2655,6.69908e+06,1460
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 116,1,867.556,4404844,1,0,1302,3.59025e+07,30,764,2657,6.69908e+06,1581
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 117,1,870.207,4404844,1,0,1302,3.59025e+07,31,764,2658,6.69908e+06,1652
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 118,1,871.893,4404844,1,0,1302,3.59025e+07,32,764,2659,6.69908e+06,1723
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 119,1,873.517,4404844,1,0,1302,3.59025e+07,33,764,2660,6.69908e+06,1799
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 120,1,875.68,4404844,1,0,1302,3.59025e+07,34,764,2661,6.69908e+06,1865
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 121,1,877.844,4404844,1,0,1302,3.59025e+07,35,764,2662,6.69908e+06,1946
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 122,1,879.22,4404844,1,0,1341,3.59025e+07,36,793,2663,6.69908e+06,2042
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 123,1,881.421,4404844,1,0,1417,3.59025e+07,37,836,2664,6.69908e+06,2153
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_3_3==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_3_3==1)))))] = FALSE
(forward)formula 124,1,884.27,4404844,1,0,1496,3.59025e+07,38,881,2665,6.69908e+06,2269
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 125,1,902.304,4841508,1,0,1568,3.93982e+07,39,925,2667,7.32322e+06,2380
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 126,1,948.458,4874924,1,0,1573,3.96418e+07,14,927,2631,7.35349e+06,115
Formula is TRUE !

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

original formula: AG(EF(((next_2==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_2==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 127,1,951.401,4874924,1,0,1573,3.96418e+07,15,927,2633,7.35349e+06,186
Formula is TRUE !

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

original formula: AG(EF(((next_3==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_3==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 128,1,953.69,4874924,1,0,1573,3.96418e+07,16,927,2635,7.35349e+06,257
Formula is TRUE !

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

original formula: AG(EF(((next_4==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_4==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 129,1,955.7,4874924,1,0,1573,3.96418e+07,17,927,2637,7.35349e+06,328
Formula is TRUE !

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

original formula: AG(EF(((next_5==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_5==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 130,1,957.232,4874924,1,0,1573,3.96418e+07,18,927,2639,7.35349e+06,399
Formula is TRUE !

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

original formula: AG(EF(((next_6==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_6==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 131,1,958.132,4874924,1,0,1573,3.96418e+07,19,927,2641,7.35349e+06,470
Formula is TRUE !

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

original formula: AG(EF(((next_7==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_7==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 132,1,958.44,4874924,1,0,1573,3.96418e+07,20,927,2643,7.35349e+06,546
Formula is TRUE !

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

original formula: AG(EF(((next_8==1)&&(ncs_3_4==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_8==1)&&(ncs_3_4==1)))))] = FALSE
(forward)formula 133,1,959.276,4874924,1,0,1573,3.96418e+07,21,927,2645,7.35349e+06,667
Formula is TRUE !

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

original formula: AG(EF(((next_0==1)&&(ncs_4_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_0==1)&&(ncs_4_0==1)))))] = FALSE
(forward)formula 134,1,981.108,4874924,1,0,1573,3.96418e+07,22,927,2648,7.35349e+06,793
Formula is TRUE !

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

original formula: AG(EF(((next_1==1)&&(ncs_4_0==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((next_1==1)&&(ncs_4_0==1)))))] = FALSE
(forward)formula 135,1,987.006,4874924,1,0,1573,3.96418e+07,23,927,2649,7.35349e+06,859
Formula is TRUE !

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-05"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is Anderson-PT-05, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r008-oct2-177944369600099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-05.tgz
mv Anderson-PT-05 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "Liveness.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 ;