Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689500594.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-PT-002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689500594
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 124K Apr 29 20:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 440K Apr 29 20:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 145K Apr 29 19:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 526K Apr 29 19:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 74K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 201K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 87K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 228K May 9 07:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K May 9 07:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 57K May 9 07:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 534K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BART-PT-002-CTLFireability-00
FORMULA_NAME BART-PT-002-CTLFireability-01
FORMULA_NAME BART-PT-002-CTLFireability-02
FORMULA_NAME BART-PT-002-CTLFireability-03
FORMULA_NAME BART-PT-002-CTLFireability-04
FORMULA_NAME BART-PT-002-CTLFireability-05
FORMULA_NAME BART-PT-002-CTLFireability-06
FORMULA_NAME BART-PT-002-CTLFireability-07
FORMULA_NAME BART-PT-002-CTLFireability-08
FORMULA_NAME BART-PT-002-CTLFireability-09
FORMULA_NAME BART-PT-002-CTLFireability-10
FORMULA_NAME BART-PT-002-CTLFireability-11
FORMULA_NAME BART-PT-002-CTLFireability-12
FORMULA_NAME BART-PT-002-CTLFireability-13
FORMULA_NAME BART-PT-002-CTLFireability-14
FORMULA_NAME BART-PT-002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1652667273680

Running Version 202205111006
[2022-05-16 02:14:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:14:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:14:35] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2022-05-16 02:14:35] [INFO ] Transformed 474 places.
[2022-05-16 02:14:35] [INFO ] Transformed 404 transitions.
[2022-05-16 02:14:35] [INFO ] Found NUPN structural information;
[2022-05-16 02:14:35] [INFO ] Parsed PT model containing 474 places and 404 transitions in 243 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Reduce places removed 210 places and 0 transitions.
Support contains 264 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 11 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:35] [INFO ] Computed 2 place invariants in 20 ms
[2022-05-16 02:14:35] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:35] [INFO ] Computed 2 place invariants in 11 ms
[2022-05-16 02:14:35] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:35] [INFO ] Computed 2 place invariants in 12 ms
[2022-05-16 02:14:36] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 404/404 transitions.
Support contains 264 out of 264 places after structural reductions.
[2022-05-16 02:14:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-16 02:14:36] [INFO ] Flatten gal took : 52 ms
FORMULA BART-PT-002-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 02:14:36] [INFO ] Flatten gal took : 28 ms
[2022-05-16 02:14:36] [INFO ] Input system was already deterministic with 404 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 814 ms. (steps per millisecond=12 ) properties (out of 68) seen :60
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:37] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-16 02:14:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 02:14:38] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2022-05-16 02:14:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 02:14:38] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :1
[2022-05-16 02:14:38] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-16 02:14:38] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :1
Fused 8 Parikh solutions to 1 different solutions.
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 7 atomic propositions for a total of 15 simplifications.
[2022-05-16 02:14:38] [INFO ] Flatten gal took : 19 ms
[2022-05-16 02:14:38] [INFO ] Flatten gal took : 23 ms
[2022-05-16 02:14:38] [INFO ] Input system was already deterministic with 404 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 11 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:38] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:38] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:38] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:38] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2022-05-16 02:14:38] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:38] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 02:14:39] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 404/404 transitions.
[2022-05-16 02:14:39] [INFO ] Flatten gal took : 15 ms
[2022-05-16 02:14:39] [INFO ] Flatten gal took : 16 ms
[2022-05-16 02:14:39] [INFO ] Input system was already deterministic with 404 transitions.
[2022-05-16 02:14:39] [INFO ] Flatten gal took : 15 ms
[2022-05-16 02:14:39] [INFO ] Flatten gal took : 14 ms
[2022-05-16 02:14:39] [INFO ] Time to serialize gal into /tmp/CTLFireability9194132619142380251.gal : 12 ms
[2022-05-16 02:14:39] [INFO ] Time to serialize properties into /tmp/CTLFireability16690360817784615134.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9194132619142380251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16690360817784615134.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,17424,0.157964,9332,2,1046,5,21923,6,0,1463,18180,0


Converting to forward existential form...Done !
original formula: E((EG(((((((AG(((TrainState_1_1_1==1)||(TrainState_2_1_1==1))) + (TrainState_1_0_0==1)) + ((TrainState_1_0_0==1)||(TrainState_2_0_0==1)))...14032
=> equivalent forward existential formula: [(FwdU(Init,(EG(((((((!(E(TRUE U !(((TrainState_1_1_1==1)||(TrainState_2_1_1==1))))) + (TrainState_1_0_0==1)) + ...14114
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.683594,24252,1,0,7,102123,16,0,6445,18180,8
FORMULA BART-PT-002-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 246 transition count 386
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 246 transition count 386
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 48 place count 234 transition count 374
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 234 transition count 374
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 228 transition count 368
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 228 transition count 368
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 222 transition count 362
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 222 transition count 362
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 216 transition count 356
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 216 transition count 356
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 210 transition count 350
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 210 transition count 350
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 112 place count 206 transition count 346
Iterating global reduction 0 with 4 rules applied. Total rules applied 116 place count 206 transition count 346
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 120 place count 202 transition count 342
Iterating global reduction 0 with 4 rules applied. Total rules applied 124 place count 202 transition count 342
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 200 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 200 transition count 340
Applied a total of 128 rules in 50 ms. Remains 200 /264 variables (removed 64) and now considering 340/404 (removed 64) transitions.
// Phase 1: matrix 340 rows 200 cols
[2022-05-16 02:14:40] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-16 02:14:40] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 340 rows 200 cols
[2022-05-16 02:14:40] [INFO ] Computed 2 place invariants in 9 ms
[2022-05-16 02:14:40] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
// Phase 1: matrix 340 rows 200 cols
[2022-05-16 02:14:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:40] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 200/264 places, 340/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 200/264 places, 340/404 transitions.
[2022-05-16 02:14:40] [INFO ] Flatten gal took : 13 ms
[2022-05-16 02:14:40] [INFO ] Flatten gal took : 23 ms
[2022-05-16 02:14:40] [INFO ] Input system was already deterministic with 340 transitions.
[2022-05-16 02:14:40] [INFO ] Flatten gal took : 24 ms
[2022-05-16 02:14:40] [INFO ] Flatten gal took : 13 ms
[2022-05-16 02:14:40] [INFO ] Time to serialize gal into /tmp/CTLFireability9903880416042219587.gal : 4 ms
[2022-05-16 02:14:40] [INFO ] Time to serialize properties into /tmp/CTLFireability5675085249962472464.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9903880416042219587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5675085249962472464.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,10000,0.071502,7164,2,788,5,11703,6,0,1143,7280,0


Converting to forward existential form...Done !
original formula: EF(EX(((EG(E(((TrainState_1_1_1==1)||(TrainState_2_1_1==1)) U (((((((((TrainState_2_3_30==1)||(TrainState_2_1_19==1))||((TrainState_1_2_2...9326
=> equivalent forward existential formula: (([((EY(FwdU(Init,TRUE)) * (EG(E(((TrainState_1_1_1==1)||(TrainState_2_1_1==1)) U (((((((((TrainState_2_3_30==1)...18850
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.430766,19564,1,0,13,80407,21,1,5402,16231,9
FORMULA BART-PT-002-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 264 transition count 400
Reduce places removed 4 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 22 rules applied. Total rules applied 26 place count 260 transition count 382
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 44 place count 242 transition count 382
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 44 place count 242 transition count 372
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 64 place count 232 transition count 372
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 76 place count 220 transition count 360
Iterating global reduction 3 with 12 rules applied. Total rules applied 88 place count 220 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 90 place count 220 transition count 358
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 96 place count 214 transition count 352
Iterating global reduction 4 with 6 rules applied. Total rules applied 102 place count 214 transition count 352
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 108 place count 208 transition count 346
Iterating global reduction 4 with 6 rules applied. Total rules applied 114 place count 208 transition count 346
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 120 place count 202 transition count 340
Iterating global reduction 4 with 6 rules applied. Total rules applied 126 place count 202 transition count 340
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 130 place count 198 transition count 336
Iterating global reduction 4 with 4 rules applied. Total rules applied 134 place count 198 transition count 336
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 138 place count 194 transition count 332
Iterating global reduction 4 with 4 rules applied. Total rules applied 142 place count 194 transition count 332
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 144 place count 192 transition count 330
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 192 transition count 330
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 170 place count 180 transition count 318
Applied a total of 170 rules in 78 ms. Remains 180 /264 variables (removed 84) and now considering 318/404 (removed 86) transitions.
// Phase 1: matrix 318 rows 180 cols
[2022-05-16 02:14:41] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:41] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 318 rows 180 cols
[2022-05-16 02:14:41] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:41] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2022-05-16 02:14:41] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 318 rows 180 cols
[2022-05-16 02:14:41] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:41] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 180/264 places, 318/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 180/264 places, 318/404 transitions.
[2022-05-16 02:14:41] [INFO ] Flatten gal took : 9 ms
[2022-05-16 02:14:41] [INFO ] Flatten gal took : 10 ms
[2022-05-16 02:14:41] [INFO ] Input system was already deterministic with 318 transitions.
[2022-05-16 02:14:41] [INFO ] Flatten gal took : 20 ms
[2022-05-16 02:14:41] [INFO ] Flatten gal took : 17 ms
[2022-05-16 02:14:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15927273560869945526.gal : 5 ms
[2022-05-16 02:14:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13824370615334766524.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15927273560869945526.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13824370615334766524.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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,8100,0.052424,5912,2,359,5,4018,6,0,1041,3681,0


Converting to forward existential form...Done !
original formula: E(EG(((TrainState_1_0_0==1)||(TrainState_2_0_0==1))) U ((AG(!((((((((((TrainState_2_3_30==1)||(TrainState_2_1_19==1))||((TrainState_1_2_2...9265
=> equivalent forward existential formula: [(((FwdU(Init,EG(((TrainState_1_0_0==1)||(TrainState_2_0_0==1)))) * (((((((((TrainState_2_3_30==1)||(TrainState_...9323
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.184946,10820,1,0,6,32039,14,0,4589,3681,5
FORMULA BART-PT-002-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 258 transition count 398
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 258 transition count 398
Applied a total of 12 rules in 21 ms. Remains 258 /264 variables (removed 6) and now considering 398/404 (removed 6) transitions.
// Phase 1: matrix 398 rows 258 cols
[2022-05-16 02:14:41] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-16 02:14:41] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 398 rows 258 cols
[2022-05-16 02:14:41] [INFO ] Computed 2 place invariants in 7 ms
[2022-05-16 02:14:42] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
// Phase 1: matrix 398 rows 258 cols
[2022-05-16 02:14:42] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 02:14:42] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 258/264 places, 398/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 258/264 places, 398/404 transitions.
[2022-05-16 02:14:42] [INFO ] Flatten gal took : 13 ms
[2022-05-16 02:14:42] [INFO ] Flatten gal took : 13 ms
[2022-05-16 02:14:42] [INFO ] Input system was already deterministic with 398 transitions.
[2022-05-16 02:14:42] [INFO ] Flatten gal took : 11 ms
[2022-05-16 02:14:42] [INFO ] Flatten gal took : 11 ms
[2022-05-16 02:14:42] [INFO ] Time to serialize gal into /tmp/CTLFireability10309583600776609249.gal : 2 ms
[2022-05-16 02:14:42] [INFO ] Time to serialize properties into /tmp/CTLFireability8492027031375286905.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10309583600776609249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8492027031375286905.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,16641,0.155787,9472,2,1022,5,22479,6,0,1433,20703,0


Converting to forward existential form...Done !
original formula: AX(AF(AX((((((((((TrainState_1_1_17==0)&&(TrainState_1_4_17==0))&&((TrainState_1_1_36==0)&&(TrainState_1_1_4==0)))&&(((TrainState_1_1_27=...3588
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(EX(!((((((((((TrainState_1_1_17==0)&&(TrainState_1_4_17==0))&&((TrainState_1_1_36==0)&&(Train...3639
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.00737,35996,1,0,28,180490,17,19,6072,100290,29
FORMULA BART-PT-002-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 1 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:43] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-16 02:14:43] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:43] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:43] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:43] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-16 02:14:43] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 404/404 transitions.
[2022-05-16 02:14:43] [INFO ] Flatten gal took : 9 ms
[2022-05-16 02:14:43] [INFO ] Flatten gal took : 10 ms
[2022-05-16 02:14:43] [INFO ] Input system was already deterministic with 404 transitions.
[2022-05-16 02:14:44] [INFO ] Flatten gal took : 9 ms
[2022-05-16 02:14:44] [INFO ] Flatten gal took : 10 ms
[2022-05-16 02:14:44] [INFO ] Time to serialize gal into /tmp/CTLFireability10134308465524196395.gal : 2 ms
[2022-05-16 02:14:44] [INFO ] Time to serialize properties into /tmp/CTLFireability225001620120695114.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10134308465524196395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability225001620120695114.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,17424,0.152758,9396,2,1046,5,21923,6,0,1463,18180,0


Converting to forward existential form...Done !
original formula: AX(((EF(((TrainState_1_1_1==1)||(TrainState_2_1_1==1))) * AF(((((((TrainState_1_2_5==0)&&(TrainState_1_4_12==0))&&((TrainState_2_4_12==0)...8674
=> equivalent forward existential formula: (([(EY(Init) * !(E(TRUE U ((TrainState_1_1_1==1)||(TrainState_2_1_1==1)))))] = FALSE * [FwdG(EY(Init),!(((((((Tr...17940
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 88/55126/316
(forward)formula 0,1,1.71461,47916,1,0,12,282743,45,2,8796,56231,17
FORMULA BART-PT-002-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 3 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:45] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-16 02:14:45] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:45] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-16 02:14:46] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
// Phase 1: matrix 404 rows 264 cols
[2022-05-16 02:14:46] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-16 02:14:46] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 264/264 places, 404/404 transitions.
[2022-05-16 02:14:46] [INFO ] Flatten gal took : 11 ms
[2022-05-16 02:14:46] [INFO ] Flatten gal took : 14 ms
[2022-05-16 02:14:46] [INFO ] Input system was already deterministic with 404 transitions.
[2022-05-16 02:14:46] [INFO ] Flatten gal took : 12 ms
[2022-05-16 02:14:46] [INFO ] Flatten gal took : 14 ms
[2022-05-16 02:14:46] [INFO ] Time to serialize gal into /tmp/CTLFireability14576571990693491558.gal : 2 ms
[2022-05-16 02:14:46] [INFO ] Time to serialize properties into /tmp/CTLFireability15024061907807269813.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14576571990693491558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15024061907807269813.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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,17424,0.139842,9372,2,1046,5,21923,6,0,1463,18180,0


Converting to forward existential form...Done !
original formula: A(EF((E((((((((((TrainState_2_3_30==1)||(TrainState_2_1_19==1))||((TrainState_1_2_22==1)||(TrainState_2_2_19==1)))||(((TrainState_2_2_30=...12836
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(((TrainState_1_0_0==1)||(TrainState_2_0_0==1))))))))) * !(E(!(!(E(TRUE U !(((Train...13055
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 88/0/316
(forward)formula 0,0,0.938696,31740,1,0,13,160266,27,3,7508,41526,16
FORMULA BART-PT-002-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 264 transition count 276
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 256 place count 136 transition count 276
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 256 place count 136 transition count 268
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 272 place count 128 transition count 268
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 284 place count 116 transition count 256
Iterating global reduction 2 with 12 rules applied. Total rules applied 296 place count 116 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 298 place count 116 transition count 254
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 306 place count 108 transition count 246
Iterating global reduction 3 with 8 rules applied. Total rules applied 314 place count 108 transition count 246
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 320 place count 102 transition count 240
Iterating global reduction 3 with 6 rules applied. Total rules applied 326 place count 102 transition count 240
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 332 place count 96 transition count 234
Iterating global reduction 3 with 6 rules applied. Total rules applied 338 place count 96 transition count 234
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 342 place count 92 transition count 230
Iterating global reduction 3 with 4 rules applied. Total rules applied 346 place count 92 transition count 230
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 350 place count 88 transition count 226
Iterating global reduction 3 with 4 rules applied. Total rules applied 354 place count 88 transition count 226
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 356 place count 86 transition count 224
Iterating global reduction 3 with 2 rules applied. Total rules applied 358 place count 86 transition count 224
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 382 place count 74 transition count 212
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 386 place count 74 transition count 208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 390 place count 72 transition count 206
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 394 place count 72 transition count 202
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 398 place count 70 transition count 200
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 402 place count 70 transition count 196
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 406 place count 68 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 410 place count 68 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 414 place count 66 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 418 place count 66 transition count 184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 422 place count 64 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 426 place count 64 transition count 178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 430 place count 62 transition count 176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 434 place count 62 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 438 place count 60 transition count 170
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 442 place count 60 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 446 place count 58 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 450 place count 58 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 454 place count 56 transition count 158
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 458 place count 56 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 462 place count 54 transition count 152
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 466 place count 54 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 470 place count 52 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 474 place count 52 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 478 place count 50 transition count 140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 482 place count 50 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 486 place count 48 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 490 place count 48 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 494 place count 46 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 498 place count 46 transition count 124
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 502 place count 44 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 506 place count 44 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 510 place count 42 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 514 place count 42 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 518 place count 40 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 522 place count 40 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 526 place count 38 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 530 place count 38 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 4 rules applied. Total rules applied 534 place count 36 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 538 place count 36 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 4 rules applied. Total rules applied 542 place count 34 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 546 place count 34 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 24 with 4 rules applied. Total rules applied 550 place count 32 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 554 place count 32 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 25 with 4 rules applied. Total rules applied 558 place count 30 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 562 place count 30 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 26 with 4 rules applied. Total rules applied 566 place count 28 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 570 place count 28 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 27 with 4 rules applied. Total rules applied 574 place count 26 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 578 place count 26 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 28 with 4 rules applied. Total rules applied 582 place count 24 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 586 place count 24 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 29 with 4 rules applied. Total rules applied 590 place count 22 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 594 place count 22 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 30 with 4 rules applied. Total rules applied 598 place count 20 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 602 place count 20 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 31 with 4 rules applied. Total rules applied 606 place count 18 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 610 place count 18 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 32 with 4 rules applied. Total rules applied 614 place count 16 transition count 38
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 618 place count 16 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 33 with 4 rules applied. Total rules applied 622 place count 14 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 626 place count 14 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 34 with 4 rules applied. Total rules applied 630 place count 12 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 634 place count 12 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 35 with 4 rules applied. Total rules applied 638 place count 10 transition count 20
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 642 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 36 with 4 rules applied. Total rules applied 646 place count 8 transition count 14
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 36 with 6 rules applied. Total rules applied 652 place count 8 transition count 8
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 656 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 38 with 2 Pre rules applied. Total rules applied 656 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 38 with 4 rules applied. Total rules applied 660 place count 4 transition count 4
Applied a total of 660 rules in 127 ms. Remains 4 /264 variables (removed 260) and now considering 4/404 (removed 400) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 02:14:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:14:47] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 02:14:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:14:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-16 02:14:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 02:14:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:14:47] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 4/264 places, 4/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/264 places, 4/404 transitions.
[2022-05-16 02:14:47] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:14:47] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:14:47] [INFO ] Input system was already deterministic with 4 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
FORMULA BART-PT-002-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 146 transition count 286
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 244 place count 138 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 132 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 126 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 282 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 294 place count 114 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 306 place count 108 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 316 place count 104 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 320 place count 104 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 324 place count 100 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 328 place count 100 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 330 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 332 place count 98 transition count 238
Applied a total of 332 rules in 26 ms. Remains 98 /264 variables (removed 166) and now considering 238/404 (removed 166) transitions.
// Phase 1: matrix 238 rows 98 cols
[2022-05-16 02:14:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:47] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 238 rows 98 cols
[2022-05-16 02:14:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:47] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 238 rows 98 cols
[2022-05-16 02:14:47] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-16 02:14:47] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/264 places, 238/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/264 places, 238/404 transitions.
[2022-05-16 02:14:47] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:14:47] [INFO ] Flatten gal took : 9 ms
[2022-05-16 02:14:47] [INFO ] Input system was already deterministic with 238 transitions.
[2022-05-16 02:14:47] [INFO ] Flatten gal took : 5 ms
[2022-05-16 02:14:47] [INFO ] Flatten gal took : 5 ms
[2022-05-16 02:14:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5254413878180547438.gal : 2 ms
[2022-05-16 02:14:47] [INFO ] Time to serialize properties into /tmp/CTLFireability8371600865482066075.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5254413878180547438.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8371600865482066075.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,2401,0.038164,5520,2,384,5,4104,6,0,633,1950,0


Converting to forward existential form...Done !
original formula: AG(AF(AX((TrainState_1_1_27==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(EX(!((TrainState_1_1_27==1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.126511,8392,1,0,6,20365,15,0,2626,5335,9
FORMULA BART-PT-002-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 206 transition count 346
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 206 transition count 346
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 162 place count 160 transition count 300
Iterating global reduction 0 with 46 rules applied. Total rules applied 208 place count 160 transition count 300
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 213 place count 155 transition count 295
Iterating global reduction 0 with 5 rules applied. Total rules applied 218 place count 155 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 221 place count 152 transition count 292
Iterating global reduction 0 with 3 rules applied. Total rules applied 224 place count 152 transition count 292
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 226 place count 150 transition count 290
Iterating global reduction 0 with 2 rules applied. Total rules applied 228 place count 150 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 229 place count 149 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 230 place count 149 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 231 place count 148 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 232 place count 148 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 233 place count 147 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 234 place count 147 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 235 place count 146 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 237 place count 145 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 238 place count 145 transition count 285
Applied a total of 238 rules in 26 ms. Remains 145 /264 variables (removed 119) and now considering 285/404 (removed 119) transitions.
// Phase 1: matrix 285 rows 145 cols
[2022-05-16 02:14:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:48] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 285 rows 145 cols
[2022-05-16 02:14:48] [INFO ] Computed 2 place invariants in 9 ms
[2022-05-16 02:14:48] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 285 rows 145 cols
[2022-05-16 02:14:48] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:48] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/264 places, 285/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/264 places, 285/404 transitions.
[2022-05-16 02:14:48] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:14:48] [INFO ] Flatten gal took : 5 ms
[2022-05-16 02:14:48] [INFO ] Input system was already deterministic with 285 transitions.
[2022-05-16 02:14:48] [INFO ] Flatten gal took : 5 ms
[2022-05-16 02:14:48] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:14:48] [INFO ] Time to serialize gal into /tmp/CTLFireability9024991595837936012.gal : 1 ms
[2022-05-16 02:14:48] [INFO ] Time to serialize properties into /tmp/CTLFireability9050362354369216768.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9024991595837936012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9050362354369216768.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,5226,0.064523,6336,2,570,5,8779,6,0,868,5570,0


Converting to forward existential form...Done !
original formula: EX((((AF(E((TrainState_2_1_39==1) U (TrainState_2_2_17==1))) * AF((TrainState_2_4_22==1))) * ((EF((TrainState_1_1_33==0)) + (TrainState_2...663
=> equivalent forward existential formula: ([(FwdU((EY(Init) * ((!(EG(!(E((TrainState_2_1_39==1) U (TrainState_2_2_17==1))))) * !(EG(!((TrainState_2_4_22==...1535
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 281/0/4
Using saturation style SCC detection
(forward)formula 0,0,0.502215,19116,1,0,25,92737,64,8,3994,30771,32
FORMULA BART-PT-002-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 350 edges and 264 vertex of which 125 / 264 are part of one of the 1 SCC in 7 ms
Free SCC test removed 124 places
Ensure Unique test removed 189 transitions
Reduce isomorphic transitions removed 189 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 140 transition count 152
Reduce places removed 63 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 67 rules applied. Total rules applied 131 place count 77 transition count 148
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 137 place count 73 transition count 146
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 137 place count 73 transition count 141
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 147 place count 68 transition count 141
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 153 place count 62 transition count 135
Iterating global reduction 3 with 6 rules applied. Total rules applied 159 place count 62 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 62 transition count 134
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 164 place count 58 transition count 130
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 58 transition count 130
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 171 place count 55 transition count 127
Iterating global reduction 4 with 3 rules applied. Total rules applied 174 place count 55 transition count 127
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 177 place count 52 transition count 124
Iterating global reduction 4 with 3 rules applied. Total rules applied 180 place count 52 transition count 124
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 182 place count 50 transition count 122
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 50 transition count 122
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 186 place count 48 transition count 120
Iterating global reduction 4 with 2 rules applied. Total rules applied 188 place count 48 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 189 place count 47 transition count 119
Iterating global reduction 4 with 1 rules applied. Total rules applied 190 place count 47 transition count 119
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 202 place count 41 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 204 place count 41 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 206 place count 40 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 208 place count 40 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 210 place count 39 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 212 place count 39 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 214 place count 38 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 216 place count 38 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 218 place count 37 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 220 place count 37 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 222 place count 36 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 224 place count 36 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 226 place count 35 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 228 place count 35 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 230 place count 34 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 232 place count 34 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 234 place count 33 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 236 place count 33 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 238 place count 32 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 240 place count 32 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 242 place count 31 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 244 place count 31 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 246 place count 30 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 248 place count 30 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 250 place count 29 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 252 place count 29 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 254 place count 28 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 256 place count 28 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 258 place count 27 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 260 place count 27 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 262 place count 26 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 264 place count 26 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 266 place count 25 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 268 place count 25 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 270 place count 24 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 271 place count 24 transition count 61
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 22 with 23 rules applied. Total rules applied 294 place count 24 transition count 38
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 22 with 7 rules applied. Total rules applied 301 place count 24 transition count 31
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 23 with 7 rules applied. Total rules applied 308 place count 17 transition count 31
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 24 with 4 rules applied. Total rules applied 312 place count 17 transition count 27
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 24 with 3 rules applied. Total rules applied 315 place count 17 transition count 24
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 25 with 4 rules applied. Total rules applied 319 place count 14 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 320 place count 13 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 27 with 2 rules applied. Total rules applied 322 place count 13 transition count 21
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 27 with 1 rules applied. Total rules applied 323 place count 13 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 324 place count 12 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 29 with 1 Pre rules applied. Total rules applied 324 place count 12 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 326 place count 11 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 29 with 1 rules applied. Total rules applied 327 place count 11 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 29 with 1 rules applied. Total rules applied 328 place count 11 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 329 place count 10 transition count 17
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 31 with 1 rules applied. Total rules applied 330 place count 10 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 31 with 1 rules applied. Total rules applied 331 place count 10 transition count 16
Applied a total of 331 rules in 81 ms. Remains 10 /264 variables (removed 254) and now considering 16/404 (removed 388) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 02:14:48] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 02:14:48] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 02:14:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:48] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-16 02:14:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 10 cols
[2022-05-16 02:14:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:49] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 10/264 places, 16/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/264 places, 16/404 transitions.
[2022-05-16 02:14:49] [INFO ] Flatten gal took : 2 ms
[2022-05-16 02:14:49] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:14:49] [INFO ] Input system was already deterministic with 16 transitions.
[2022-05-16 02:14:49] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:14:49] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:14:49] [INFO ] Time to serialize gal into /tmp/CTLFireability18414532952627819525.gal : 1 ms
[2022-05-16 02:14:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10551082830658897755.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18414532952627819525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10551082830658897755.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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,24,0.003586,4372,2,19,5,79,6,0,58,53,0


Converting to forward existential form...Done !
original formula: E((AG(!(AF(EG((TrainState_2_0_0==1))))) + (TrainState_2_2_23==1)) U EG((E((TrainState_1_1_7==1) U ((TrainState_1_1_35==1)||(TrainState_1_...193
=> equivalent forward existential formula: [FwdG(FwdU(Init,(!(E(TRUE U !(!(!(EG(!(EG((TrainState_2_0_0==1))))))))) + (TrainState_2_2_23==1))),(E((TrainStat...255
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 14/0/2
(forward)formula 0,0,0.007792,5084,1,0,13,435,45,5,267,332,18
FORMULA BART-PT-002-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 202 transition count 342
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 202 transition count 342
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 174 place count 152 transition count 292
Iterating global reduction 0 with 50 rules applied. Total rules applied 224 place count 152 transition count 292
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 231 place count 145 transition count 285
Iterating global reduction 0 with 7 rules applied. Total rules applied 238 place count 145 transition count 285
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 243 place count 140 transition count 280
Iterating global reduction 0 with 5 rules applied. Total rules applied 248 place count 140 transition count 280
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 253 place count 135 transition count 275
Iterating global reduction 0 with 5 rules applied. Total rules applied 258 place count 135 transition count 275
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 263 place count 130 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 268 place count 130 transition count 270
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 273 place count 125 transition count 265
Iterating global reduction 0 with 5 rules applied. Total rules applied 278 place count 125 transition count 265
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 282 place count 121 transition count 261
Iterating global reduction 0 with 4 rules applied. Total rules applied 286 place count 121 transition count 261
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 289 place count 118 transition count 258
Iterating global reduction 0 with 3 rules applied. Total rules applied 292 place count 118 transition count 258
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 294 place count 116 transition count 256
Iterating global reduction 0 with 2 rules applied. Total rules applied 296 place count 116 transition count 256
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 298 place count 114 transition count 254
Iterating global reduction 0 with 2 rules applied. Total rules applied 300 place count 114 transition count 254
Applied a total of 300 rules in 40 ms. Remains 114 /264 variables (removed 150) and now considering 254/404 (removed 150) transitions.
// Phase 1: matrix 254 rows 114 cols
[2022-05-16 02:14:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:49] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 254 rows 114 cols
[2022-05-16 02:14:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:49] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
// Phase 1: matrix 254 rows 114 cols
[2022-05-16 02:14:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:49] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/264 places, 254/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/264 places, 254/404 transitions.
[2022-05-16 02:14:49] [INFO ] Flatten gal took : 5 ms
[2022-05-16 02:14:49] [INFO ] Flatten gal took : 9 ms
[2022-05-16 02:14:49] [INFO ] Input system was already deterministic with 254 transitions.
[2022-05-16 02:14:49] [INFO ] Flatten gal took : 4 ms
[2022-05-16 02:14:49] [INFO ] Flatten gal took : 4 ms
[2022-05-16 02:14:49] [INFO ] Time to serialize gal into /tmp/CTLFireability16172644616274361307.gal : 1 ms
[2022-05-16 02:14:49] [INFO ] Time to serialize properties into /tmp/CTLFireability635502047943016440.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16172644616274361307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability635502047943016440.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,3245,0.063181,5452,2,446,5,5175,6,0,713,2591,0


Converting to forward existential form...Done !
original formula: (AF(AX(E(E((TrainState_1_1_1==1) U (TrainState_2_2_22==1)) U (TrainState_1_3_7==1)))) + E((AG((TrainState_1_1_18==1)) + (TrainState_2_1_3...305
=> equivalent forward existential formula: [FwdG((Init * !(E((!(E(TRUE U !((TrainState_1_1_18==1)))) + (TrainState_2_1_38==1)) U (!((!((((TrainState_1_1_31...383
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 252/0/2
(forward)formula 0,0,0.451525,21076,1,0,97,114590,42,68,3199,57604,88
FORMULA BART-PT-002-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 179 place count 148 transition count 288
Iterating global reduction 0 with 53 rules applied. Total rules applied 232 place count 148 transition count 288
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 238 place count 142 transition count 282
Iterating global reduction 0 with 6 rules applied. Total rules applied 244 place count 142 transition count 282
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 249 place count 137 transition count 277
Iterating global reduction 0 with 5 rules applied. Total rules applied 254 place count 137 transition count 277
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 259 place count 132 transition count 272
Iterating global reduction 0 with 5 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 269 place count 127 transition count 267
Iterating global reduction 0 with 5 rules applied. Total rules applied 274 place count 127 transition count 267
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 279 place count 122 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 284 place count 122 transition count 262
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 289 place count 117 transition count 257
Iterating global reduction 0 with 5 rules applied. Total rules applied 294 place count 117 transition count 257
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 298 place count 113 transition count 253
Iterating global reduction 0 with 4 rules applied. Total rules applied 302 place count 113 transition count 253
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 306 place count 109 transition count 249
Iterating global reduction 0 with 4 rules applied. Total rules applied 310 place count 109 transition count 249
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 312 place count 107 transition count 247
Iterating global reduction 0 with 2 rules applied. Total rules applied 314 place count 107 transition count 247
Applied a total of 314 rules in 31 ms. Remains 107 /264 variables (removed 157) and now considering 247/404 (removed 157) transitions.
// Phase 1: matrix 247 rows 107 cols
[2022-05-16 02:14:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:50] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 247 rows 107 cols
[2022-05-16 02:14:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:50] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
// Phase 1: matrix 247 rows 107 cols
[2022-05-16 02:14:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:50] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/264 places, 247/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/264 places, 247/404 transitions.
[2022-05-16 02:14:50] [INFO ] Flatten gal took : 5 ms
[2022-05-16 02:14:50] [INFO ] Flatten gal took : 4 ms
[2022-05-16 02:14:50] [INFO ] Input system was already deterministic with 247 transitions.
[2022-05-16 02:14:50] [INFO ] Flatten gal took : 7 ms
[2022-05-16 02:14:50] [INFO ] Flatten gal took : 16 ms
[2022-05-16 02:14:50] [INFO ] Time to serialize gal into /tmp/CTLFireability2183566709219146457.gal : 1 ms
[2022-05-16 02:14:50] [INFO ] Time to serialize properties into /tmp/CTLFireability2190032409928175691.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2183566709219146457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2190032409928175691.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,2856,0.056934,5596,2,420,5,5304,6,0,678,2748,0


Converting to forward existential form...Done !
original formula: EG(AX((((TrainState_1_1_32==0) + !(A((TrainState_1_1_34==1) U (TrainState_2_3_14==1)))) + (EX((TrainState_1_0_0==0)) * EF((TrainState_1_4...167
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((((TrainState_1_1_32==0) + !(!((E(!((TrainState_2_3_14==1)) U (!((TrainState_1_1_34==1)) * !((...295
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 245/0/2
(forward)formula 0,1,0.211407,10728,1,0,11,32695,33,3,3203,10556,18
FORMULA BART-PT-002-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 178 place count 149 transition count 289
Iterating global reduction 0 with 52 rules applied. Total rules applied 230 place count 149 transition count 289
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 237 place count 142 transition count 282
Iterating global reduction 0 with 7 rules applied. Total rules applied 244 place count 142 transition count 282
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 249 place count 137 transition count 277
Iterating global reduction 0 with 5 rules applied. Total rules applied 254 place count 137 transition count 277
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 259 place count 132 transition count 272
Iterating global reduction 0 with 5 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 269 place count 127 transition count 267
Iterating global reduction 0 with 5 rules applied. Total rules applied 274 place count 127 transition count 267
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 278 place count 123 transition count 263
Iterating global reduction 0 with 4 rules applied. Total rules applied 282 place count 123 transition count 263
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 286 place count 119 transition count 259
Iterating global reduction 0 with 4 rules applied. Total rules applied 290 place count 119 transition count 259
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 293 place count 116 transition count 256
Iterating global reduction 0 with 3 rules applied. Total rules applied 296 place count 116 transition count 256
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 299 place count 113 transition count 253
Iterating global reduction 0 with 3 rules applied. Total rules applied 302 place count 113 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 303 place count 112 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 304 place count 112 transition count 252
Applied a total of 304 rules in 20 ms. Remains 112 /264 variables (removed 152) and now considering 252/404 (removed 152) transitions.
// Phase 1: matrix 252 rows 112 cols
[2022-05-16 02:14:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:50] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 252 rows 112 cols
[2022-05-16 02:14:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:50] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 252 rows 112 cols
[2022-05-16 02:14:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 02:14:51] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/264 places, 252/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/264 places, 252/404 transitions.
[2022-05-16 02:14:51] [INFO ] Flatten gal took : 5 ms
[2022-05-16 02:14:51] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:14:51] [INFO ] Input system was already deterministic with 252 transitions.
[2022-05-16 02:14:51] [INFO ] Flatten gal took : 5 ms
[2022-05-16 02:14:51] [INFO ] Flatten gal took : 5 ms
[2022-05-16 02:14:51] [INFO ] Time to serialize gal into /tmp/CTLFireability4483079336195702342.gal : 1 ms
[2022-05-16 02:14:51] [INFO ] Time to serialize properties into /tmp/CTLFireability1898724409168503691.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4483079336195702342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1898724409168503691.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,3136,0.045548,5892,2,440,5,5982,6,0,703,3136,0


Converting to forward existential form...Done !
original formula: A((AX(A(((TrainState_2_0_0!=1)&&(TrainState_2_4_15==1)) U AF((TrainState_2_0_0==1)))) + ((TrainState_1_1_26==1) * EF(((TrainState_1_4_16=...236
=> equivalent forward existential formula: [((Init * !(EG(!(((TrainState_2_1_38==1)&&(TrainState_1_0_0==1)))))) * !(E(!(((TrainState_2_1_38==1)&&(TrainStat...516
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 211/0/41
(forward)formula 0,0,0.284446,13932,1,0,15,57396,41,9,3345,23899,22
FORMULA BART-PT-002-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 398 edges and 264 vertex of which 259 / 264 are part of one of the 2 SCC in 1 ms
Free SCC test removed 257 places
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 394 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 9
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 5 transition count 7
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 3 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 3 transition count 5
Applied a total of 9 rules in 3 ms. Remains 3 /264 variables (removed 261) and now considering 5/404 (removed 399) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-16 02:14:51] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:14:51] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-16 02:14:51] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:14:51] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-16 02:14:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-16 02:14:51] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:14:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 3/264 places, 5/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/264 places, 5/404 transitions.
[2022-05-16 02:14:51] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:14:51] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:14:51] [INFO ] Input system was already deterministic with 5 transitions.
[2022-05-16 02:14:51] [INFO ] Flatten gal took : 0 ms
[2022-05-16 02:14:51] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:14:51] [INFO ] Time to serialize gal into /tmp/CTLFireability565659206511127857.gal : 1 ms
[2022-05-16 02:14:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6358871675080316659.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability565659206511127857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6358871675080316659.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
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,3,0.003872,4328,2,6,5,20,5,0,18,12,0


Converting to forward existential form...Done !
original formula: EG(AF(AG(((TrainState_2_2_18==1)||(TrainState_2_1_17==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !(((TrainState_2_2_18==1)||(TrainState_2_1_17==1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.006202,4880,1,0,5,47,19,0,75,27,8
FORMULA BART-PT-002-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 202 transition count 342
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 202 transition count 342
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 172 place count 154 transition count 294
Iterating global reduction 0 with 48 rules applied. Total rules applied 220 place count 154 transition count 294
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 227 place count 147 transition count 287
Iterating global reduction 0 with 7 rules applied. Total rules applied 234 place count 147 transition count 287
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 239 place count 142 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 244 place count 142 transition count 282
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 249 place count 137 transition count 277
Iterating global reduction 0 with 5 rules applied. Total rules applied 254 place count 137 transition count 277
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 259 place count 132 transition count 272
Iterating global reduction 0 with 5 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 268 place count 128 transition count 268
Iterating global reduction 0 with 4 rules applied. Total rules applied 272 place count 128 transition count 268
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 276 place count 124 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 280 place count 124 transition count 264
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 283 place count 121 transition count 261
Iterating global reduction 0 with 3 rules applied. Total rules applied 286 place count 121 transition count 261
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 289 place count 118 transition count 258
Iterating global reduction 0 with 3 rules applied. Total rules applied 292 place count 118 transition count 258
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 294 place count 116 transition count 256
Iterating global reduction 0 with 2 rules applied. Total rules applied 296 place count 116 transition count 256
Applied a total of 296 rules in 15 ms. Remains 116 /264 variables (removed 148) and now considering 256/404 (removed 148) transitions.
// Phase 1: matrix 256 rows 116 cols
[2022-05-16 02:14:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:51] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 256 rows 116 cols
[2022-05-16 02:14:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:51] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 256 rows 116 cols
[2022-05-16 02:14:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:14:51] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/264 places, 256/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 116/264 places, 256/404 transitions.
[2022-05-16 02:14:51] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:14:51] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:14:51] [INFO ] Input system was already deterministic with 256 transitions.
[2022-05-16 02:14:51] [INFO ] Flatten gal took : 7 ms
[2022-05-16 02:14:51] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:14:51] [INFO ] Time to serialize gal into /tmp/CTLFireability13743246875090943707.gal : 1 ms
[2022-05-16 02:14:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13387561316682896943.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13743246875090943707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13387561316682896943.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
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,3339,0.047148,5720,2,450,5,5923,6,0,723,3372,0


Converting to forward existential form...Done !
original formula: EF((((EG(((TrainState_1_0_0==1)||(TrainState_2_0_0==1))) + AG(AF((TrainState_2_1_23==1)))) + (AX(((TrainState_2_0_0==1) * E((TrainState_2...524
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * ((EG(((TrainState_1_0_0==1)||(TrainState_2_0_0==1))) + !(E(TRUE U !(!(EG(!((TrainState_2...1454
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 215/0/41
Hit Full ! (commute/partial/dont) 252/0/4
(forward)formula 0,1,0.25086,12616,1,0,25,49152,66,12,3290,14983,28
FORMULA BART-PT-002-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2022-05-16 02:14:52] [INFO ] Flatten gal took : 13 ms
[2022-05-16 02:14:52] [INFO ] Flatten gal took : 9 ms
Total runtime 17198 ms.

BK_STOP 1652667292389

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="BART-PT-002"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-4028"
echo " Executing tool itstools"
echo " Input is BART-PT-002, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689500594"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-002.tgz
mv BART-PT-002 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;