About the Execution of ITS-Tools for BART-COL-005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3033.764 | 510020.00 | 528340.00 | 3265.60 | TTTTTTTFTFTTTFFF | normal |
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-165245689500538.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-COL-005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689500538
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 6.6K Apr 29 20:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 29 20:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 20:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 20:15 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 4.0K May 9 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 186K 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-COL-005-CTLFireability-00
FORMULA_NAME BART-COL-005-CTLFireability-01
FORMULA_NAME BART-COL-005-CTLFireability-02
FORMULA_NAME BART-COL-005-CTLFireability-03
FORMULA_NAME BART-COL-005-CTLFireability-04
FORMULA_NAME BART-COL-005-CTLFireability-05
FORMULA_NAME BART-COL-005-CTLFireability-06
FORMULA_NAME BART-COL-005-CTLFireability-07
FORMULA_NAME BART-COL-005-CTLFireability-08
FORMULA_NAME BART-COL-005-CTLFireability-09
FORMULA_NAME BART-COL-005-CTLFireability-10
FORMULA_NAME BART-COL-005-CTLFireability-11
FORMULA_NAME BART-COL-005-CTLFireability-12
FORMULA_NAME BART-COL-005-CTLFireability-13
FORMULA_NAME BART-COL-005-CTLFireability-14
FORMULA_NAME BART-COL-005-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1652665969848
Running Version 202205111006
[2022-05-16 01:52:50] [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 01:52:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:52:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 01:52:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 01:52:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 563 ms
[2022-05-16 01:52:51] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2022-05-16 01:52:51] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 11603 PT places and 7.03614756E9 transition bindings in 46 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
[2022-05-16 01:52:51] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 5 ms.
[2022-05-16 01:52:51] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Arc [1:1*[(MOD (ADD $tsp 1) 6), $ds2]] contains successor/predecessor on variables of sort speed
Symmetric sort wr.t. initial and guards and successors and join/free detected :trainid
Symmetric sort wr.t. initial detected :trainid
Symmetric sort wr.t. initial and guards detected :trainid
Applying symmetric unfolding of full symmetric sort :trainid domain size was 5
[2022-05-16 01:52:51] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 139 ms.
[2022-05-16 01:52:51] [INFO ] Unfolded 16 HLPN properties in 2 ms.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
[2022-05-16 01:52:51] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 3 ms
Reduce places removed 10487 places and 121 transitions.
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:52:52] [INFO ] Computed 1 place invariants in 13 ms
[2022-05-16 01:52:52] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:52:52] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 01:52:52] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:52:52] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:52:52] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2022-05-16 01:52:52] [INFO ] Flatten gal took : 37 ms
[2022-05-16 01:52:52] [INFO ] Flatten gal took : 21 ms
[2022-05-16 01:52:52] [INFO ] Input system was already deterministic with 202 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:52:52] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 01:52:53] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2022-05-16 01:52:53] [INFO ] Flatten gal took : 15 ms
[2022-05-16 01:52:53] [INFO ] Flatten gal took : 22 ms
[2022-05-16 01:52:53] [INFO ] Input system was already deterministic with 202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:52:53] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:52:53] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:52:53] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 01:52:53] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2022-05-16 01:52:53] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:52:53] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 01:52:53] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
[2022-05-16 01:52:53] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:52:53] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:52:53] [INFO ] Input system was already deterministic with 202 transitions.
[2022-05-16 01:52:53] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:52:53] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:52:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12380605754967249820.gal : 6 ms
[2022-05-16 01:52:53] [INFO ] Time to serialize properties into /tmp/CTLFireability11617902643370051542.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/CTLFireability12380605754967249820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11617902643370051542.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,3.59933e+08,0.08649,8008,2,788,5,22378,6,0,733,13230,0
Converting to forward existential form...Done !
original formula: (E(EG(!(AG((TrainState_0>=1)))) U !((!((((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState_189>=1)))||(((T...7722
=> equivalent forward existential formula: ((([FwdG((FwdU(Init,EG(!(!(E(TRUE U !((TrainState_0>=1))))))) * !(!((((((((((TrainState_61>=1)||(TrainState_191>...14575
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.45217,51112,1,0,12,262322,35,2,4214,181198,15
FORMULA BART-COL-005-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 132 transition count 179
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Applied a total of 46 rules in 22 ms. Remains 109 /132 variables (removed 23) and now considering 179/202 (removed 23) transitions.
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 01:52:55] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 01:52:55] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 01:52:55] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:52:55] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2022-05-16 01:52:55] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 179 rows 109 cols
[2022-05-16 01:52:55] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:52:55] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 109/132 places, 179/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/132 places, 179/202 transitions.
[2022-05-16 01:52:55] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:52:55] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:52:55] [INFO ] Input system was already deterministic with 179 transitions.
[2022-05-16 01:52:55] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:52:55] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:52:55] [INFO ] Time to serialize gal into /tmp/CTLFireability3495874939138017226.gal : 2 ms
[2022-05-16 01:52:55] [INFO ] Time to serialize properties into /tmp/CTLFireability18213612035069709828.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/CTLFireability3495874939138017226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18213612035069709828.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,1.40365e+08,0.104335,7548,2,650,5,18523,6,0,618,14362,0
Converting to forward existential form...Done !
original formula: EG((((((((E((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=1)))||(((TrainState_176>=1)||(TrainStat...1795
=> equivalent forward existential formula: [FwdG(Init,(((((((E((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=1)))||...1838
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 155/0/24
(forward)formula 0,1,2.15112,56464,1,0,63,296371,29,57,3175,266716,66
FORMULA BART-COL-005-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 100 transition count 170
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 100 transition count 170
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 91 place count 73 transition count 143
Iterating global reduction 0 with 27 rules applied. Total rules applied 118 place count 73 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 69 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 69 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 66 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 66 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 63 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 60 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 60 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 57 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 57 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 54 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 54 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 52 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 162 place count 50 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 49 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 49 transition count 119
Applied a total of 166 rules in 22 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 01:52:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:52:57] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 01:52:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:52:57] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 01:52:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:52:57] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/132 places, 119/202 transitions.
[2022-05-16 01:52:57] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:52:57] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:52:57] [INFO ] Input system was already deterministic with 119 transitions.
[2022-05-16 01:52:57] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:52:57] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:52:57] [INFO ] Time to serialize gal into /tmp/CTLFireability13117030345044670689.gal : 1 ms
[2022-05-16 01:52:57] [INFO ] Time to serialize properties into /tmp/CTLFireability9148658922612203201.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/CTLFireability13117030345044670689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9148658922612203201.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,2.86968e+06,0.021976,5244,2,290,5,5547,6,0,318,3844,0
Converting to forward existential form...Done !
original formula: AX(EX(EF(AX((TrainState_42>=1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(E(TRUE U !(EX(!((TrainState_42>=1))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.075211,7740,1,0,8,18414,15,1,1463,10566,6
FORMULA BART-COL-005-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 11 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 01:52:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:52:57] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 01:52:57] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 01:52:58] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 100 cols
[2022-05-16 01:52:58] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:52:58] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/132 places, 170/202 transitions.
[2022-05-16 01:52:58] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:52:58] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:52:58] [INFO ] Input system was already deterministic with 170 transitions.
[2022-05-16 01:52:58] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:52:58] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:52:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11399079083610381359.gal : 0 ms
[2022-05-16 01:52:58] [INFO ] Time to serialize properties into /tmp/CTLFireability10903141645457690409.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/CTLFireability11399079083610381359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10903141645457690409.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,9.19625e+07,0.076669,6824,2,596,5,14190,6,0,573,8201,0
Converting to forward existential form...Done !
original formula: AF((((((((EF(AX((TrainState_42>=1))) + EX((TrainState_42>=1))) + ((TrainState_61>=1)||(TrainState_65>=1))) + (((TrainState_53>=1)||(Train...2062
=> equivalent forward existential formula: [FwdG(Init,!((((((((E(TRUE U !(EX(!((TrainState_42>=1))))) + EX((TrainState_42>=1))) + ((TrainState_61>=1)||(Tra...2119
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.699613,26756,1,0,16,131553,27,8,2948,100046,16
FORMULA BART-COL-005-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:52:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:52:58] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:52:58] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 01:52:58] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:52:58] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-16 01:52:59] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
[2022-05-16 01:52:59] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:52:59] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:52:59] [INFO ] Input system was already deterministic with 202 transitions.
[2022-05-16 01:52:59] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:52:59] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:52:59] [INFO ] Time to serialize gal into /tmp/CTLFireability15331602303544839168.gal : 1 ms
[2022-05-16 01:52:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7855352481246693119.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/CTLFireability15331602303544839168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7855352481246693119.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,3.59933e+08,0.100247,8156,2,788,5,22378,6,0,733,13230,0
Converting to forward existential form...Done !
original formula: AG((EX(E((((((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState_189>=1)))||(((TrainState_65>=1)||(TrainStat...6460
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(E((((((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState...24741
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 200/0/2
Hit Full ! (commute/partial/dont) 23/0/179
(forward)formula 0,1,15.313,372224,1,0,45,2.13758e+06,67,18,4506,1.93721e+06,36
FORMULA BART-COL-005-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:53:14] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 01:53:14] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:53:14] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:53:14] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:53:14] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-16 01:53:14] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
[2022-05-16 01:53:14] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:53:14] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:53:14] [INFO ] Input system was already deterministic with 202 transitions.
[2022-05-16 01:53:14] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:53:14] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:53:14] [INFO ] Time to serialize gal into /tmp/CTLFireability3686332521444841179.gal : 2 ms
[2022-05-16 01:53:14] [INFO ] Time to serialize properties into /tmp/CTLFireability9870981355988444242.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/CTLFireability3686332521444841179.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9870981355988444242.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,3.59933e+08,0.120948,8068,2,788,5,22378,6,0,733,13230,0
Converting to forward existential form...Done !
original formula: A(AG(((AX(!((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=1)))||(((TrainState_176>=1)||(TrainStat...5767
=> equivalent forward existential formula: [((Init * !(EG(!((!((((((((EX(!(E(TRUE U !((TrainState_0>=1))))) + !(EG(!((((((TrainState_131>=1)||(TrainState_1...9902
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,19.2501,448984,1,0,36,2.68895e+06,45,21,4206,2.32517e+06,25
FORMULA BART-COL-005-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 132 transition count 138
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 68 transition count 138
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 128 place count 68 transition count 134
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 136 place count 64 transition count 134
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 142 place count 58 transition count 128
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 58 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 149 place count 58 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 54 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 54 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 51 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 51 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 48 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 48 transition count 117
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 171 place count 46 transition count 115
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 46 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 175 place count 44 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 44 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 43 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 43 transition count 112
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 3 with 12 rules applied. Total rules applied 191 place count 37 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 193 place count 37 transition count 104
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 4 with 2 rules applied. Total rules applied 195 place count 36 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 197 place count 36 transition count 101
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 199 place count 35 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 201 place count 35 transition count 98
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 203 place count 34 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 205 place count 34 transition count 95
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 207 place count 33 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 209 place count 33 transition count 92
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 8 with 2 rules applied. Total rules applied 211 place count 32 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 213 place count 32 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 215 place count 31 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 217 place count 31 transition count 86
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 219 place count 30 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 221 place count 30 transition count 83
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 223 place count 29 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 225 place count 29 transition count 80
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 227 place count 28 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 229 place count 28 transition count 77
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 231 place count 27 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 233 place count 27 transition count 74
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 235 place count 26 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 237 place count 26 transition count 71
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 239 place count 25 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 241 place count 25 transition count 68
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 16 with 2 rules applied. Total rules applied 243 place count 24 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 245 place count 24 transition count 65
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 247 place count 23 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 249 place count 23 transition count 62
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 251 place count 22 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 253 place count 22 transition count 59
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 255 place count 21 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 257 place count 21 transition count 56
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 259 place count 20 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 261 place count 20 transition count 53
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 263 place count 19 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 265 place count 19 transition count 50
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 22 with 2 rules applied. Total rules applied 267 place count 18 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 269 place count 18 transition count 47
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 23 with 2 rules applied. Total rules applied 271 place count 17 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 273 place count 17 transition count 44
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 24 with 2 rules applied. Total rules applied 275 place count 16 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 277 place count 16 transition count 41
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 25 with 2 rules applied. Total rules applied 279 place count 15 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 281 place count 15 transition count 38
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 26 with 2 rules applied. Total rules applied 283 place count 14 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 285 place count 14 transition count 35
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 27 with 2 rules applied. Total rules applied 287 place count 13 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 289 place count 13 transition count 32
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 28 with 2 rules applied. Total rules applied 291 place count 12 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 293 place count 12 transition count 29
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 29 with 2 rules applied. Total rules applied 295 place count 11 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 297 place count 11 transition count 26
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 30 with 2 rules applied. Total rules applied 299 place count 10 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 301 place count 10 transition count 23
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 31 with 2 rules applied. Total rules applied 303 place count 9 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 305 place count 9 transition count 20
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 32 with 2 rules applied. Total rules applied 307 place count 8 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 309 place count 8 transition count 17
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 33 with 2 rules applied. Total rules applied 311 place count 7 transition count 16
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 313 place count 7 transition count 14
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 34 with 2 rules applied. Total rules applied 315 place count 6 transition count 13
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 317 place count 6 transition count 11
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 35 with 2 rules applied. Total rules applied 319 place count 5 transition count 10
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 321 place count 5 transition count 8
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 36 with 2 rules applied. Total rules applied 323 place count 4 transition count 7
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 36 with 3 rules applied. Total rules applied 326 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 328 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 38 with 1 Pre rules applied. Total rules applied 328 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 38 with 2 rules applied. Total rules applied 330 place count 2 transition count 2
Applied a total of 330 rules in 35 ms. Remains 2 /132 variables (removed 130) and now considering 2/202 (removed 200) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 01:53:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:53:34] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 01:53:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:53:34] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-16 01:53:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 01:53:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:53:34] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 2/132 places, 2/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/132 places, 2/202 transitions.
[2022-05-16 01:53:34] [INFO ] Flatten gal took : 1 ms
[2022-05-16 01:53:34] [INFO ] Flatten gal took : 0 ms
[2022-05-16 01:53:34] [INFO ] Input system was already deterministic with 2 transitions.
[2022-05-16 01:53:34] [INFO ] Flatten gal took : 0 ms
[2022-05-16 01:53:34] [INFO ] Flatten gal took : 0 ms
[2022-05-16 01:53:34] [INFO ] Time to serialize gal into /tmp/CTLFireability12495920480356610488.gal : 3 ms
[2022-05-16 01:53:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10115761698076715856.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/CTLFireability12495920480356610488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10115761698076715856.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,6,0.002007,4240,2,8,5,40,6,0,13,25,0
Converting to forward existential form...Done !
original formula: E(EF((EF((TrainState_42>=1)) * EG((TrainState_42>=1)))) U EG((TrainState_42>=1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,E(TRUE U (E(TRUE U (TrainState_42>=1)) * EG((TrainState_42>=1))))),(TrainState_42>=1))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/2
(forward)formula 0,1,0.003509,5176,1,0,6,51,30,1,63,36,13
FORMULA BART-COL-005-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:53:34] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:53:34] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:53:34] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 01:53:34] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:53:34] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-16 01:53:34] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
[2022-05-16 01:53:34] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:53:34] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:53:34] [INFO ] Input system was already deterministic with 202 transitions.
[2022-05-16 01:53:34] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:53:34] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:53:34] [INFO ] Time to serialize gal into /tmp/CTLFireability11389977128905191298.gal : 1 ms
[2022-05-16 01:53:34] [INFO ] Time to serialize properties into /tmp/CTLFireability11815866133980752171.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/CTLFireability11389977128905191298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11815866133980752171.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,3.59933e+08,0.11603,7916,2,788,5,22378,6,0,733,13230,0
Converting to forward existential form...Done !
original formula: (AF(AX(!(A(((TrainState_42>=1)||(TrainState_0>=1)) U EX(((((((((TrainState_61>=1)||(TrainState_65>=1))||((TrainState_53>=1)||(TrainState_...7122
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!(!(!((E(!(EX(((((((((TrainState_61>=1)||(TrainState_65>=1))||((TrainState_53>=1)||(TrainStat...26957
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,8.05697,232548,1,0,70,1.55189e+06,49,64,4275,1.14387e+06,75
FORMULA BART-COL-005-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:53:42] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:53:42] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:53:42] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 01:53:42] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:53:42] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 01:53:43] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
[2022-05-16 01:53:43] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:53:43] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:53:43] [INFO ] Input system was already deterministic with 202 transitions.
[2022-05-16 01:53:43] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:53:43] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:53:43] [INFO ] Time to serialize gal into /tmp/CTLFireability15117021527648496389.gal : 1 ms
[2022-05-16 01:53:43] [INFO ] Time to serialize properties into /tmp/CTLFireability4939321987180655858.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/CTLFireability15117021527648496389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4939321987180655858.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,3.59933e+08,0.118049,8104,2,788,5,22378,6,0,733,13230,0
Converting to forward existential form...Done !
original formula: (EF((A((TrainState_42>=1) U (TrainState_42>=1)) + (TrainState_42>=1))) * ((E(A(((((((((TrainState_61>=1)||(TrainState_65>=1))||((TrainSta...7518
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!((E(!((TrainState_42>=1)) U (!((TrainState_42>=1)) * !((TrainState_42>=1)))) + EG(!((Trai...15781
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 178/187/24
Hit Full ! (commute/partial/dont) 200/0/2
Detected timeout of ITS tools.
[2022-05-16 01:54:13] [INFO ] Flatten gal took : 16 ms
[2022-05-16 01:54:13] [INFO ] Applying decomposition
[2022-05-16 01:54:13] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2752230434462359949.txt' '-o' '/tmp/graph2752230434462359949.bin' '-w' '/tmp/graph2752230434462359949.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2752230434462359949.bin' '-l' '-1' '-v' '-w' '/tmp/graph2752230434462359949.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:54:13] [INFO ] Decomposing Gal with order
[2022-05-16 01:54:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:54:13] [INFO ] Removed a total of 47 redundant transitions.
[2022-05-16 01:54:13] [INFO ] Flatten gal took : 37 ms
[2022-05-16 01:54:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 8 ms.
[2022-05-16 01:54:13] [INFO ] Time to serialize gal into /tmp/CTLFireability4478673057339711117.gal : 3 ms
[2022-05-16 01:54:13] [INFO ] Time to serialize properties into /tmp/CTLFireability2787102616649988278.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/CTLFireability4478673057339711117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2787102616649988278.ctl'
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...253
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.59933e+08,0.571287,22772,218,109,33353,4111,406,83684,117,13311,0
Converting to forward existential form...Done !
original formula: (EF((A((i9.i0.u0.TrainState_42>=1) U (i9.i0.u0.TrainState_42>=1)) + (i9.i0.u0.TrainState_42>=1))) * ((E(A(((((((((u4.TrainState_61>=1)||(...10347
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!((E(!((i9.i0.u0.TrainState_42>=1)) U (!((i9.i0.u0.TrainState_42>=1)) * !((i9.i0.u0.TrainS...21664
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 11 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 01:54:43] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:54:43] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 01:54:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:54:43] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 160 rows 90 cols
[2022-05-16 01:54:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:54:43] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/132 places, 160/202 transitions.
[2022-05-16 01:54:43] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:54:43] [INFO ] Flatten gal took : 10 ms
[2022-05-16 01:54:43] [INFO ] Input system was already deterministic with 160 transitions.
[2022-05-16 01:54:43] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:54:43] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:54:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17255493214335831832.gal : 1 ms
[2022-05-16 01:54:43] [INFO ] Time to serialize properties into /tmp/CTLFireability16243062757693126836.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/CTLFireability17255493214335831832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16243062757693126836.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,5.4891e+07,0.08154,6956,2,536,5,14332,6,0,523,11731,0
Converting to forward existential form...Done !
original formula: AG(AX(AF((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=1)))||(((TrainState_176>=1)||(TrainState_1...231
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178...283
Hit Full ! (commute/partial/dont) 141/147/19
(forward)formula 0,0,0.310416,12412,1,0,6,42940,20,0,2671,27366,9
FORMULA BART-COL-005-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:54:44] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:54:44] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:54:44] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 01:54:44] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:54:44] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-16 01:54:44] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
[2022-05-16 01:54:44] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:54:44] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:54:44] [INFO ] Input system was already deterministic with 202 transitions.
[2022-05-16 01:54:44] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:54:44] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:54:44] [INFO ] Time to serialize gal into /tmp/CTLFireability1999586430295949996.gal : 1 ms
[2022-05-16 01:54:44] [INFO ] Time to serialize properties into /tmp/CTLFireability15942799393939027147.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/CTLFireability1999586430295949996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15942799393939027147.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,3.59933e+08,0.164239,8116,2,788,5,22378,6,0,733,13230,0
Converting to forward existential form...Done !
original formula: EG(((EF(((((((((TrainState_61<1)&&(TrainState_65<1))&&((TrainState_53<1)&&(TrainState_118<1)))&&(((TrainState_57<1)&&(TrainState_110<1))&...7209
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U ((((((((TrainState_61<1)&&(TrainState_65<1))&&((TrainState_53<1)&&(TrainState_118<1)))&&((...10764
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 34/11194/168
Hit Full ! (commute/partial/dont) 178/0/24
(forward)formula 0,1,8.88954,182724,1,0,97,1.12921e+06,46,82,5163,840417,105
FORMULA BART-COL-005-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:54:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:54:53] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:54:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:54:53] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2022-05-16 01:54:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:54:53] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-16 01:54:53] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
[2022-05-16 01:54:53] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:54:53] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:54:53] [INFO ] Input system was already deterministic with 202 transitions.
[2022-05-16 01:54:53] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:54:53] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:54:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9964201273539387332.gal : 1 ms
[2022-05-16 01:54:53] [INFO ] Time to serialize properties into /tmp/CTLFireability6090824362782516603.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/CTLFireability9964201273539387332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6090824362782516603.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,3.59933e+08,0.150762,8168,2,788,5,22378,6,0,733,13230,0
Converting to forward existential form...Done !
original formula: E((AF(!(AF(E((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=1)))||(((TrainState_176>=1)||(TrainSta...8148
=> equivalent forward existential formula: [(FwdU(Init,(!(EG(!(!(!(EG(!(E((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_...12195
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 44/13659/158
Hit Full ! (commute/partial/dont) 178/0/24
Hit Full ! (commute/partial/dont) 178/0/24
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,7.00108,204464,1,0,92,1.18163e+06,56,59,5174,1.08431e+06,95
FORMULA BART-COL-005-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:55:00] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 01:55:00] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:55:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:55:00] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:55:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:55:00] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
[2022-05-16 01:55:00] [INFO ] Flatten gal took : 12 ms
[2022-05-16 01:55:00] [INFO ] Flatten gal took : 12 ms
[2022-05-16 01:55:01] [INFO ] Input system was already deterministic with 202 transitions.
[2022-05-16 01:55:01] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:55:01] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:55:01] [INFO ] Time to serialize gal into /tmp/CTLFireability1569866219749020674.gal : 1 ms
[2022-05-16 01:55:01] [INFO ] Time to serialize properties into /tmp/CTLFireability7946435075412783259.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/CTLFireability1569866219749020674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7946435075412783259.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,3.59933e+08,0.117633,8044,2,788,5,22378,6,0,733,13230,0
Converting to forward existential form...Done !
original formula: EX(AX((EX((((((((EX(((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState_189>=1)))||(((TrainState_65>=1)||(T...7164
=> equivalent forward existential formula: [(EY(Init) * !(EX(!((EX((((((((EX(((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainSt...7221
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.07223,37432,1,0,29,204053,23,12,4103,123863,18
FORMULA BART-COL-005-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 100 transition count 170
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 100 transition count 170
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 91 place count 73 transition count 143
Iterating global reduction 0 with 27 rules applied. Total rules applied 118 place count 73 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 69 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 69 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 66 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 66 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 63 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 60 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 60 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 57 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 57 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 54 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 54 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 52 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 162 place count 50 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 49 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 49 transition count 119
Applied a total of 166 rules in 24 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 01:55:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:55:02] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 01:55:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:55:02] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 01:55:02] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-16 01:55:02] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/132 places, 119/202 transitions.
[2022-05-16 01:55:02] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:55:02] [INFO ] Flatten gal took : 14 ms
[2022-05-16 01:55:02] [INFO ] Input system was already deterministic with 119 transitions.
[2022-05-16 01:55:02] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:55:02] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:55:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8249612029715130015.gal : 1 ms
[2022-05-16 01:55:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14024497908082176127.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/CTLFireability8249612029715130015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14024497908082176127.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,2.86968e+06,0.021615,5524,2,290,5,5547,6,0,318,3844,0
Converting to forward existential form...Done !
original formula: AX(AG((TrainState_42<1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((TrainState_42<1)))] = FALSE
(forward)formula 0,0,0.035078,5964,1,0,9,6221,10,2,755,4600,4
FORMULA BART-COL-005-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 100 transition count 170
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 100 transition count 170
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 91 place count 73 transition count 143
Iterating global reduction 0 with 27 rules applied. Total rules applied 118 place count 73 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 69 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 69 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 66 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 66 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 63 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 60 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 60 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 57 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 57 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 54 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 54 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 52 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 162 place count 50 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 49 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 49 transition count 119
Applied a total of 166 rules in 8 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 01:55:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:55:02] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 01:55:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:55:02] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 119 rows 49 cols
[2022-05-16 01:55:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:55:02] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/132 places, 119/202 transitions.
[2022-05-16 01:55:02] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:55:02] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:55:02] [INFO ] Input system was already deterministic with 119 transitions.
[2022-05-16 01:55:02] [INFO ] Flatten gal took : 2 ms
[2022-05-16 01:55:02] [INFO ] Flatten gal took : 3 ms
[2022-05-16 01:55:02] [INFO ] Time to serialize gal into /tmp/CTLFireability17253781334611131414.gal : 0 ms
[2022-05-16 01:55:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13372808779939143436.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/CTLFireability17253781334611131414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13372808779939143436.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,2.86968e+06,0.021584,5540,2,290,5,5547,6,0,318,3844,0
Converting to forward existential form...Done !
original formula: EG(AG(AX((TrainState_0>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EX(!((TrainState_0>=1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.07137,7504,1,0,7,16477,21,0,1511,10241,8
FORMULA BART-COL-005-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:55:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:55:02] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:55:02] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:55:02] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 202 rows 132 cols
[2022-05-16 01:55:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:55:02] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/132 places, 202/202 transitions.
[2022-05-16 01:55:02] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:55:02] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:55:02] [INFO ] Input system was already deterministic with 202 transitions.
[2022-05-16 01:55:02] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:55:02] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:55:02] [INFO ] Time to serialize gal into /tmp/CTLFireability16795696355533575755.gal : 1 ms
[2022-05-16 01:55:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17617297884925620143.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/CTLFireability16795696355533575755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17617297884925620143.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,3.59933e+08,0.122013,8056,2,788,5,22378,6,0,733,13230,0
Converting to forward existential form...Done !
original formula: A(A((TrainState_0>=1) U ((((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState_189>=1)))||(((TrainState_65>=1)...1816
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(((((((TrainState_131>=1)||(TrainState_130>=1))||((TrainState_175>=1)||(TrainState_178>=1...5496
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 34/11194/168
Using saturation style SCC detection
(forward)formula 0,0,13.5417,393336,1,0,125,2.46596e+06,36,81,4608,2.01172e+06,88
FORMULA BART-COL-005-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2022-05-16 01:55:16] [INFO ] Flatten gal took : 11 ms
[2022-05-16 01:55:16] [INFO ] Flatten gal took : 10 ms
[2022-05-16 01:55:16] [INFO ] Applying decomposition
[2022-05-16 01:55:16] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10417790722693369046.txt' '-o' '/tmp/graph10417790722693369046.bin' '-w' '/tmp/graph10417790722693369046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10417790722693369046.bin' '-l' '-1' '-v' '-w' '/tmp/graph10417790722693369046.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:55:16] [INFO ] Decomposing Gal with order
[2022-05-16 01:55:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:55:16] [INFO ] Removed a total of 49 redundant transitions.
[2022-05-16 01:55:16] [INFO ] Flatten gal took : 15 ms
[2022-05-16 01:55:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2022-05-16 01:55:16] [INFO ] Time to serialize gal into /tmp/CTLFireability247217907622201759.gal : 3 ms
[2022-05-16 01:55:16] [INFO ] Time to serialize properties into /tmp/CTLFireability3899919590124996259.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/CTLFireability247217907622201759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3899919590124996259.ctl'
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...252
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.59933e+08,0.421296,18060,230,115,24766,4479,419,53078,125,10733,0
Converting to forward existential form...Done !
original formula: (EF((A((i4.i1.u0.TrainState_42>=1) U (i4.i1.u0.TrainState_42>=1)) + (i4.i1.u0.TrainState_42>=1))) * ((E(A(((((((((u3.TrainState_61>=1)||(...10333
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!((E(!((i4.i1.u0.TrainState_42>=1)) U (!((i4.i1.u0.TrainState_42>=1)) * !((i4.i1.u0.TrainS...21645
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,362.123,2757860,1,0,1.76097e+06,2.67688e+06,1348,9.21773e+06,456,4.35748e+07,190303
FORMULA BART-COL-005-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Total runtime 508802 ms.
BK_STOP 1652666479868
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ 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-COL-005"
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-COL-005, 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-165245689500538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-COL-005.tgz
mv BART-COL-005 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 '
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 ;