fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r006-tajo-165245689600618
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for BART-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13039.632 1410535.00 1484692.00 1036.60 TFFTFFTFTTFTFFTT 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-165245689600618.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-PT-020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689600618
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 1.7M Apr 29 21:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.0M Apr 29 21:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Apr 29 20:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.9M Apr 29 20:53 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 644K May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.7M May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 590K May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K May 9 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 4.8M May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652667754900

Running Version 202205111006
[2022-05-16 02:22:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:22:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:22:36] [INFO ] Load time of PNML (sax parser for PT used): 347 ms
[2022-05-16 02:22:36] [INFO ] Transformed 2850 places.
[2022-05-16 02:22:36] [INFO ] Transformed 4040 transitions.
[2022-05-16 02:22:36] [INFO ] Found NUPN structural information;
[2022-05-16 02:22:36] [INFO ] Parsed PT model containing 2850 places and 4040 transitions in 491 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 118 ms.
Reduce places removed 210 places and 0 transitions.
Support contains 2640 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 29 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:22:37] [INFO ] Computed 20 place invariants in 40 ms
[2022-05-16 02:22:37] [INFO ] Implicit Places using invariants in 538 ms returned []
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:22:37] [INFO ] Computed 20 place invariants in 21 ms
[2022-05-16 02:22:39] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 2084 ms to find 0 implicit places.
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:22:39] [INFO ] Computed 20 place invariants in 15 ms
[2022-05-16 02:22:42] [INFO ] Dead Transitions using invariants and state equation in 3017 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2640/2640 places, 4040/4040 transitions.
Support contains 2640 out of 2640 places after structural reductions.
[2022-05-16 02:22:43] [INFO ] Flatten gal took : 476 ms
[2022-05-16 02:22:45] [INFO ] Flatten gal took : 344 ms
[2022-05-16 02:22:47] [INFO ] Input system was already deterministic with 4040 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1030 ms. (steps per millisecond=9 ) properties (out of 90) seen :74
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:22:49] [INFO ] Computed 20 place invariants in 22 ms
[2022-05-16 02:22:50] [INFO ] [Real]Absence check using 20 positive place invariants in 57 ms returned sat
[2022-05-16 02:22:53] [INFO ] After 4338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-16 02:22:54] [INFO ] [Nat]Absence check using 20 positive place invariants in 25 ms returned sat
[2022-05-16 02:22:58] [INFO ] After 2923ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-16 02:23:01] [INFO ] After 6265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1699 ms.
[2022-05-16 02:23:03] [INFO ] After 9391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 8 different solutions.
Finished Parikh walk after 44 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 11 properties in 129 ms.
[2022-05-16 02:23:03] [INFO ] Flatten gal took : 261 ms
[2022-05-16 02:23:05] [INFO ] Flatten gal took : 259 ms
[2022-05-16 02:23:07] [INFO ] Input system was already deterministic with 4040 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 23 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:23:07] [INFO ] Computed 20 place invariants in 36 ms
[2022-05-16 02:23:08] [INFO ] Implicit Places using invariants in 369 ms returned []
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:23:08] [INFO ] Computed 20 place invariants in 43 ms
[2022-05-16 02:23:08] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:23:08] [INFO ] Computed 20 place invariants in 19 ms
[2022-05-16 02:23:10] [INFO ] Dead Transitions using invariants and state equation in 1936 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2640/2640 places, 4040/4040 transitions.
[2022-05-16 02:23:10] [INFO ] Flatten gal took : 82 ms
[2022-05-16 02:23:10] [INFO ] Flatten gal took : 98 ms
[2022-05-16 02:23:11] [INFO ] Input system was already deterministic with 4040 transitions.
[2022-05-16 02:23:11] [INFO ] Flatten gal took : 108 ms
[2022-05-16 02:23:11] [INFO ] Flatten gal took : 114 ms
[2022-05-16 02:23:11] [INFO ] Time to serialize gal into /tmp/CTLFireability6218208929000428385.gal : 28 ms
[2022-05-16 02:23:11] [INFO ] Time to serialize properties into /tmp/CTLFireability14395142130024861255.ctl : 27 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/CTLFireability6218208929000428385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14395142130024861255.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.
Detected timeout of ITS tools.
[2022-05-16 02:23:41] [INFO ] Flatten gal took : 108 ms
[2022-05-16 02:23:41] [INFO ] Applying decomposition
[2022-05-16 02:23:41] [INFO ] Flatten gal took : 114 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/graph17564252638971117489.txt' '-o' '/tmp/graph17564252638971117489.bin' '-w' '/tmp/graph17564252638971117489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17564252638971117489.bin' '-l' '-1' '-v' '-w' '/tmp/graph17564252638971117489.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:23:42] [INFO ] Decomposing Gal with order
[2022-05-16 02:23:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:23:42] [INFO ] Removed a total of 299 redundant transitions.
[2022-05-16 02:23:43] [INFO ] Flatten gal took : 377 ms
[2022-05-16 02:23:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2022-05-16 02:23:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1920114544514188295.gal : 34 ms
[2022-05-16 02:23:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16342746546503950412.ctl : 27 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/CTLFireability1920114544514188295.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16342746546503950412.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...254
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.57916e+42,1.2652,32100,737,75,12877,3188,2334,12326,252,2715,0


Converting to forward existential form...Done !
original formula: EX(EX((E(AX((((((((((((i12.i0.u94.TrainState_10_0_0==1)||(i8.i0.u73.TrainState_9_0_0==1))||((i9.i0.u74.TrainState_13_0_0==1)||(i19.i12.u4...311828
=> equivalent forward existential formula: ([((EY(EY(Init)) * E(!(EX(!((((((((((((i12.i0.u94.TrainState_10_0_0==1)||(i8.i0.u73.TrainState_9_0_0==1))||((i9....506522
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,2.69694,53132,1,0,71103,16452,45720,135245,4053,35188,102157
FORMULA BART-PT-020-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 2640 transition count 4020
Reduce places removed 20 places and 0 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 1 with 180 rules applied. Total rules applied 200 place count 2620 transition count 3860
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 360 place count 2460 transition count 3860
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 280
Deduced a syphon composed of 280 places in 2 ms
Reduce places removed 280 places and 0 transitions.
Iterating global reduction 3 with 560 rules applied. Total rules applied 920 place count 2180 transition count 3580
Applied a total of 920 rules in 382 ms. Remains 2180 /2640 variables (removed 460) and now considering 3580/4040 (removed 460) transitions.
// Phase 1: matrix 3580 rows 2180 cols
[2022-05-16 02:23:49] [INFO ] Computed 20 place invariants in 18 ms
[2022-05-16 02:23:50] [INFO ] Implicit Places using invariants in 423 ms returned []
// Phase 1: matrix 3580 rows 2180 cols
[2022-05-16 02:23:50] [INFO ] Computed 20 place invariants in 11 ms
[2022-05-16 02:23:50] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
[2022-05-16 02:23:50] [INFO ] Redundant transitions in 280 ms returned []
// Phase 1: matrix 3580 rows 2180 cols
[2022-05-16 02:23:50] [INFO ] Computed 20 place invariants in 24 ms
[2022-05-16 02:23:52] [INFO ] Dead Transitions using invariants and state equation in 1846 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 2180/2640 places, 3580/4040 transitions.
Finished structural reductions, in 1 iterations. Remains : 2180/2640 places, 3580/4040 transitions.
[2022-05-16 02:23:52] [INFO ] Flatten gal took : 70 ms
[2022-05-16 02:23:52] [INFO ] Flatten gal took : 81 ms
[2022-05-16 02:23:53] [INFO ] Input system was already deterministic with 3580 transitions.
[2022-05-16 02:23:53] [INFO ] Flatten gal took : 68 ms
[2022-05-16 02:23:53] [INFO ] Flatten gal took : 69 ms
[2022-05-16 02:23:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16775655343847840529.gal : 9 ms
[2022-05-16 02:23:53] [INFO ] Time to serialize properties into /tmp/CTLFireability5803327667802226567.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/CTLFireability16775655343847840529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5803327667802226567.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,5.60441e+40,4.08945,51788,2,4341,5,52940,6,0,12303,47919,0


Converting to forward existential form...Done !
original formula: A(EG(AG(E(((((((TrainState_13_1_1==1)||(TrainState_14_1_1==1))||((TrainState_15_1_1==1)||(TrainState_16_1_1==1)))||(((TrainState_17_1_1==...53415
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U ((((((TrainState_13_1_1==1)||(TrainState_14_1_1==1))||((TrainState_15_1_1==1)||(Train...61272
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:181)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:186)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:24:23] [INFO ] Flatten gal took : 107 ms
[2022-05-16 02:24:23] [INFO ] Applying decomposition
[2022-05-16 02:24:23] [INFO ] Flatten gal took : 86 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/graph11518584208288059680.txt' '-o' '/tmp/graph11518584208288059680.bin' '-w' '/tmp/graph11518584208288059680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11518584208288059680.bin' '-l' '-1' '-v' '-w' '/tmp/graph11518584208288059680.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:24:23] [INFO ] Decomposing Gal with order
[2022-05-16 02:24:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:24:24] [INFO ] Removed a total of 325 redundant transitions.
[2022-05-16 02:24:24] [INFO ] Flatten gal took : 173 ms
[2022-05-16 02:24:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 13 ms.
[2022-05-16 02:24:24] [INFO ] Time to serialize gal into /tmp/CTLFireability15953273612452017779.gal : 12 ms
[2022-05-16 02:24:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6890532090213816344.ctl : 6 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/CTLFireability15953273612452017779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6890532090213816344.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...254
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.60441e+40,1.12716,27084,505,85,14427,7561,1793,15493,399,7703,0


Converting to forward existential form...Done !
original formula: A(EG(AG(E(((((((i3.i0.u7.TrainState_13_1_1==1)||(i17.i1.u15.TrainState_14_1_1==1))||((i14.i1.u16.TrainState_15_1_1==1)||(i4.i0.u8.TrainSt...75594
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U ((((((i3.i0.u7.TrainState_13_1_1==1)||(i17.i1.u15.TrainState_14_1_1==1))||((i14.i1.u1...91865
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,3.31665,78276,1,0,71355,227363,20533,123516,2555,266165,110008
FORMULA BART-PT-020-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 22 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:24:28] [INFO ] Computed 20 place invariants in 11 ms
[2022-05-16 02:24:28] [INFO ] Implicit Places using invariants in 534 ms returned []
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:24:28] [INFO ] Computed 20 place invariants in 27 ms
[2022-05-16 02:24:29] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:24:29] [INFO ] Computed 20 place invariants in 56 ms
[2022-05-16 02:24:31] [INFO ] Dead Transitions using invariants and state equation in 2202 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2640/2640 places, 4040/4040 transitions.
[2022-05-16 02:24:31] [INFO ] Flatten gal took : 85 ms
[2022-05-16 02:24:32] [INFO ] Flatten gal took : 112 ms
[2022-05-16 02:24:32] [INFO ] Input system was already deterministic with 4040 transitions.
[2022-05-16 02:24:32] [INFO ] Flatten gal took : 101 ms
[2022-05-16 02:24:32] [INFO ] Flatten gal took : 105 ms
[2022-05-16 02:24:32] [INFO ] Time to serialize gal into /tmp/CTLFireability18411307354966089361.gal : 9 ms
[2022-05-16 02:24:32] [INFO ] Time to serialize properties into /tmp/CTLFireability1263380719025014117.ctl : 54 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/CTLFireability18411307354966089361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1263380719025014117.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.
Detected timeout of ITS tools.
[2022-05-16 02:25:02] [INFO ] Flatten gal took : 100 ms
[2022-05-16 02:25:02] [INFO ] Applying decomposition
[2022-05-16 02:25:02] [INFO ] Flatten gal took : 100 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/graph6300812476828584797.txt' '-o' '/tmp/graph6300812476828584797.bin' '-w' '/tmp/graph6300812476828584797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6300812476828584797.bin' '-l' '-1' '-v' '-w' '/tmp/graph6300812476828584797.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:25:03] [INFO ] Decomposing Gal with order
[2022-05-16 02:25:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:25:03] [INFO ] Removed a total of 411 redundant transitions.
[2022-05-16 02:25:03] [INFO ] Flatten gal took : 183 ms
[2022-05-16 02:25:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-16 02:25:07] [INFO ] Time to serialize gal into /tmp/CTLFireability2292133049303237721.gal : 15 ms
[2022-05-16 02:25:07] [INFO ] Time to serialize properties into /tmp/CTLFireability144052679327685654.ctl : 24 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/CTLFireability2292133049303237721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability144052679327685654.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,2.57916e+42,1.52684,31940,855,75,18172,3020,2709,18790,242,2429,0


Converting to forward existential form...Done !
original formula: AG(A(!(((!((((((((((((((i15.i0.u100.TrainState_6_1_31==1)||(i15.i10.u784.TrainState_6_2_35==1))||((i7.i10.u844.TrainState_15_2_37==1)||(i...385259
=> equivalent forward existential formula: ([(EY((FwdU(FwdU(Init,TRUE),!(!(EX(!(((((((((((((i15.i0.u100.TrainState_6_1_31==1)||(i15.i10.u784.TrainState_6_2...518445
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,6.41242,166760,1,0,272325,8752,20678,954511,1514,19741,364666
FORMULA BART-PT-020-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 22 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:25:13] [INFO ] Computed 20 place invariants in 11 ms
[2022-05-16 02:25:14] [INFO ] Implicit Places using invariants in 534 ms returned []
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:25:14] [INFO ] Computed 20 place invariants in 27 ms
[2022-05-16 02:25:15] [INFO ] Implicit Places using invariants and state equation in 1667 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:25:15] [INFO ] Computed 20 place invariants in 12 ms
[2022-05-16 02:25:17] [INFO ] Dead Transitions using invariants and state equation in 1905 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2640/2640 places, 4040/4040 transitions.
[2022-05-16 02:25:17] [INFO ] Flatten gal took : 81 ms
[2022-05-16 02:25:18] [INFO ] Flatten gal took : 107 ms
[2022-05-16 02:25:18] [INFO ] Input system was already deterministic with 4040 transitions.
[2022-05-16 02:25:18] [INFO ] Flatten gal took : 101 ms
[2022-05-16 02:25:18] [INFO ] Flatten gal took : 105 ms
[2022-05-16 02:25:18] [INFO ] Time to serialize gal into /tmp/CTLFireability15614496050017353970.gal : 8 ms
[2022-05-16 02:25:18] [INFO ] Time to serialize properties into /tmp/CTLFireability14523143878185671268.ctl : 13 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/CTLFireability15614496050017353970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14523143878185671268.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.
Detected timeout of ITS tools.
[2022-05-16 02:25:48] [INFO ] Flatten gal took : 144 ms
[2022-05-16 02:25:48] [INFO ] Applying decomposition
[2022-05-16 02:25:48] [INFO ] Flatten gal took : 129 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/graph7539637499245478522.txt' '-o' '/tmp/graph7539637499245478522.bin' '-w' '/tmp/graph7539637499245478522.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7539637499245478522.bin' '-l' '-1' '-v' '-w' '/tmp/graph7539637499245478522.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:25:49] [INFO ] Decomposing Gal with order
[2022-05-16 02:25:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:25:49] [INFO ] Removed a total of 446 redundant transitions.
[2022-05-16 02:25:49] [INFO ] Flatten gal took : 242 ms
[2022-05-16 02:25:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-16 02:25:53] [INFO ] Time to serialize gal into /tmp/CTLFireability13360617297812101463.gal : 12 ms
[2022-05-16 02:25:53] [INFO ] Time to serialize properties into /tmp/CTLFireability13877116121481357765.ctl : 21 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/CTLFireability13360617297812101463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13877116121481357765.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...255
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.57916e+42,1.41648,31516,995,75,21958,3309,2877,21344,269,2918,0


Converting to forward existential form...Done !
original formula: E(((EF(((((((i2.i0.u11.TrainState_13_1_1==1)||(i0.i0.u6.TrainState_14_1_1==1))||((i3.i0.u12.TrainState_15_1_1==1)||(i18.i0.u13.TrainState...410433
=> equivalent forward existential formula: (([(FwdU(FwdU(Init,((E(TRUE U ((((((i2.i0.u11.TrainState_13_1_1==1)||(i0.i0.u6.TrainState_14_1_1==1))||((i3.i0.u...885259
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,3.8327,81328,1,0,75612,180320,30094,119396,1907,202137,170381
FORMULA BART-PT-020-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 28 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:25:57] [INFO ] Computed 20 place invariants in 30 ms
[2022-05-16 02:25:57] [INFO ] Implicit Places using invariants in 374 ms returned []
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:25:57] [INFO ] Computed 20 place invariants in 12 ms
[2022-05-16 02:25:58] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:25:58] [INFO ] Computed 20 place invariants in 26 ms
[2022-05-16 02:26:00] [INFO ] Dead Transitions using invariants and state equation in 2241 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2640/2640 places, 4040/4040 transitions.
[2022-05-16 02:26:00] [INFO ] Flatten gal took : 93 ms
[2022-05-16 02:26:01] [INFO ] Flatten gal took : 131 ms
[2022-05-16 02:26:01] [INFO ] Input system was already deterministic with 4040 transitions.
[2022-05-16 02:26:01] [INFO ] Flatten gal took : 115 ms
[2022-05-16 02:26:01] [INFO ] Flatten gal took : 118 ms
[2022-05-16 02:26:01] [INFO ] Time to serialize gal into /tmp/CTLFireability12644900997108109596.gal : 10 ms
[2022-05-16 02:26:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14034424539709660621.ctl : 14 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/CTLFireability12644900997108109596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14034424539709660621.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.
Detected timeout of ITS tools.
[2022-05-16 02:26:31] [INFO ] Flatten gal took : 179 ms
[2022-05-16 02:26:31] [INFO ] Applying decomposition
[2022-05-16 02:26:32] [INFO ] Flatten gal took : 175 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/graph1066624876035329647.txt' '-o' '/tmp/graph1066624876035329647.bin' '-w' '/tmp/graph1066624876035329647.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1066624876035329647.bin' '-l' '-1' '-v' '-w' '/tmp/graph1066624876035329647.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:26:32] [INFO ] Decomposing Gal with order
[2022-05-16 02:26:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:26:32] [INFO ] Removed a total of 403 redundant transitions.
[2022-05-16 02:26:33] [INFO ] Flatten gal took : 225 ms
[2022-05-16 02:26:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-05-16 02:26:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3126614258860085730.gal : 17 ms
[2022-05-16 02:26:36] [INFO ] Time to serialize properties into /tmp/CTLFireability11065619386822411034.ctl : 22 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/CTLFireability3126614258860085730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11065619386822411034.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...254
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.57916e+42,1.35998,31672,905,75,19430,3408,2729,19719,290,2975,0


Converting to forward existential form...Done !
original formula: (EF(AG((((((((((((i4.i2.u190.TrainState_8_3_9==1)||(i9.i0.u26.TrainState_1_2_5==1))||((i4.i1.u166.TrainState_8_3_7==1)||(i4.i0.u100.Train...459712
=> equivalent forward existential formula: (((([(EY(((FwdU((Init * !(E(TRUE U !(E(TRUE U !((((((((((((i4.i2.u190.TrainState_8_3_9==1)||(i9.i0.u26.TrainStat...1084515
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 151 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:27:06] [INFO ] Computed 20 place invariants in 30 ms
[2022-05-16 02:27:07] [INFO ] Implicit Places using invariants in 609 ms returned []
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:27:07] [INFO ] Computed 20 place invariants in 14 ms
[2022-05-16 02:27:07] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
// Phase 1: matrix 4040 rows 2640 cols
[2022-05-16 02:27:07] [INFO ] Computed 20 place invariants in 27 ms
[2022-05-16 02:27:10] [INFO ] Dead Transitions using invariants and state equation in 2236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2640/2640 places, 4040/4040 transitions.
[2022-05-16 02:27:10] [INFO ] Flatten gal took : 70 ms
[2022-05-16 02:27:10] [INFO ] Flatten gal took : 87 ms
[2022-05-16 02:27:10] [INFO ] Input system was already deterministic with 4040 transitions.
[2022-05-16 02:27:10] [INFO ] Flatten gal took : 84 ms
[2022-05-16 02:27:10] [INFO ] Flatten gal took : 126 ms
[2022-05-16 02:27:10] [INFO ] Time to serialize gal into /tmp/CTLFireability11077073077787665732.gal : 12 ms
[2022-05-16 02:27:10] [INFO ] Time to serialize properties into /tmp/CTLFireability15380631760650154701.ctl : 9 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/CTLFireability11077073077787665732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15380631760650154701.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.
Detected timeout of ITS tools.
[2022-05-16 02:27:41] [INFO ] Flatten gal took : 162 ms
[2022-05-16 02:27:41] [INFO ] Applying decomposition
[2022-05-16 02:27:41] [INFO ] Flatten gal took : 111 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/graph13634692554682962750.txt' '-o' '/tmp/graph13634692554682962750.bin' '-w' '/tmp/graph13634692554682962750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13634692554682962750.bin' '-l' '-1' '-v' '-w' '/tmp/graph13634692554682962750.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:27:41] [INFO ] Decomposing Gal with order
[2022-05-16 02:27:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:27:41] [INFO ] Removed a total of 292 redundant transitions.
[2022-05-16 02:27:42] [INFO ] Flatten gal took : 204 ms
[2022-05-16 02:27:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2022-05-16 02:27:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11801225614552064472.gal : 14 ms
[2022-05-16 02:27:44] [INFO ] Time to serialize properties into /tmp/CTLFireability11063174234787332331.ctl : 9 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/CTLFireability11801225614552064472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11063174234787332331.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...255
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.57916e+42,1.29319,31800,723,75,12088,2943,2268,11035,248,2239,0


Converting to forward existential form...Done !
original formula: A(!((EF(((!(((((((i5.i0.u15.TrainState_13_1_1==1)||(i2.i0.u16.TrainState_14_1_1==1))||((i6.i0.u3.TrainState_15_1_1==1)||(i10.i0.u17.Train...187519
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((!(E(TRUE U !(((((((((((((((i3.i0.u50.TrainState_6_1_7==1)||(i13.i0.u51.TrainState...355950
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
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
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,12.4278,437688,1,0,680428,202092,22149,2.95386e+06,1782,452602,628733
FORMULA BART-PT-020-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 180 place count 2460 transition count 3860
Iterating global reduction 0 with 180 rules applied. Total rules applied 360 place count 2460 transition count 3860
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 480 place count 2340 transition count 3740
Iterating global reduction 0 with 120 rules applied. Total rules applied 600 place count 2340 transition count 3740
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 660 place count 2280 transition count 3680
Iterating global reduction 0 with 60 rules applied. Total rules applied 720 place count 2280 transition count 3680
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 780 place count 2220 transition count 3620
Iterating global reduction 0 with 60 rules applied. Total rules applied 840 place count 2220 transition count 3620
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 900 place count 2160 transition count 3560
Iterating global reduction 0 with 60 rules applied. Total rules applied 960 place count 2160 transition count 3560
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 1020 place count 2100 transition count 3500
Iterating global reduction 0 with 60 rules applied. Total rules applied 1080 place count 2100 transition count 3500
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1120 place count 2060 transition count 3460
Iterating global reduction 0 with 40 rules applied. Total rules applied 1160 place count 2060 transition count 3460
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1200 place count 2020 transition count 3420
Iterating global reduction 0 with 40 rules applied. Total rules applied 1240 place count 2020 transition count 3420
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1260 place count 2000 transition count 3400
Iterating global reduction 0 with 20 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Applied a total of 1280 rules in 214 ms. Remains 2000 /2640 variables (removed 640) and now considering 3400/4040 (removed 640) transitions.
// Phase 1: matrix 3400 rows 2000 cols
[2022-05-16 02:27:57] [INFO ] Computed 20 place invariants in 12 ms
[2022-05-16 02:27:57] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 3400 rows 2000 cols
[2022-05-16 02:27:57] [INFO ] Computed 20 place invariants in 14 ms
[2022-05-16 02:27:58] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
// Phase 1: matrix 3400 rows 2000 cols
[2022-05-16 02:27:58] [INFO ] Computed 20 place invariants in 13 ms
[2022-05-16 02:27:59] [INFO ] Dead Transitions using invariants and state equation in 1179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2000/2640 places, 3400/4040 transitions.
Finished structural reductions, in 1 iterations. Remains : 2000/2640 places, 3400/4040 transitions.
[2022-05-16 02:27:59] [INFO ] Flatten gal took : 48 ms
[2022-05-16 02:27:59] [INFO ] Flatten gal took : 56 ms
[2022-05-16 02:27:59] [INFO ] Input system was already deterministic with 3400 transitions.
[2022-05-16 02:27:59] [INFO ] Flatten gal took : 51 ms
[2022-05-16 02:28:00] [INFO ] Flatten gal took : 53 ms
[2022-05-16 02:28:00] [INFO ] Time to serialize gal into /tmp/CTLFireability15879821880738505369.gal : 5 ms
[2022-05-16 02:28:00] [INFO ] Time to serialize properties into /tmp/CTLFireability11137401337252982711.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/CTLFireability15879821880738505369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11137401337252982711.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.
Detected timeout of ITS tools.
[2022-05-16 02:28:30] [INFO ] Flatten gal took : 60 ms
[2022-05-16 02:28:30] [INFO ] Applying decomposition
[2022-05-16 02:28:30] [INFO ] Flatten gal took : 60 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/graph2930496976457129175.txt' '-o' '/tmp/graph2930496976457129175.bin' '-w' '/tmp/graph2930496976457129175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2930496976457129175.bin' '-l' '-1' '-v' '-w' '/tmp/graph2930496976457129175.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:28:30] [INFO ] Decomposing Gal with order
[2022-05-16 02:28:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:28:30] [INFO ] Removed a total of 956 redundant transitions.
[2022-05-16 02:28:30] [INFO ] Flatten gal took : 155 ms
[2022-05-16 02:28:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 14 ms.
[2022-05-16 02:28:31] [INFO ] Time to serialize gal into /tmp/CTLFireability172469193844711871.gal : 11 ms
[2022-05-16 02:28:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15425594110894171564.ctl : 5 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/CTLFireability172469193844711871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15425594110894171564.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,1e+40,0.860968,24768,789,91,12033,9443,2454,11344,455,14786,0


Converting to forward existential form...Done !
original formula: !(E((((((((((((i10.i0.u160.TrainState_10_0_0==1)||(i19.i4.u637.TrainState_9_0_0==1))||((i12.i0.u37.TrainState_13_0_0==1)||(i8.i0.u39.Trai...93777
=> equivalent forward existential formula: [((((FwdU(Init,(((((((((((i10.i0.u160.TrainState_10_0_0==1)||(i19.i4.u637.TrainState_9_0_0==1))||((i12.i0.u37.Tr...93828
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.88111,44216,1,0,24222,138234,11207,34640,2045,156444,52349
FORMULA BART-PT-020-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 2640 transition count 4000
Reduce places removed 40 places and 0 transitions.
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Iterating post reduction 1 with 220 rules applied. Total rules applied 260 place count 2600 transition count 3820
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 2 with 180 rules applied. Total rules applied 440 place count 2420 transition count 3820
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 440 place count 2420 transition count 3720
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 640 place count 2320 transition count 3720
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 760 place count 2200 transition count 3600
Iterating global reduction 3 with 120 rules applied. Total rules applied 880 place count 2200 transition count 3600
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 900 place count 2200 transition count 3580
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 960 place count 2140 transition count 3520
Iterating global reduction 4 with 60 rules applied. Total rules applied 1020 place count 2140 transition count 3520
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 1080 place count 2080 transition count 3460
Iterating global reduction 4 with 60 rules applied. Total rules applied 1140 place count 2080 transition count 3460
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 1200 place count 2020 transition count 3400
Iterating global reduction 4 with 60 rules applied. Total rules applied 1260 place count 2020 transition count 3400
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 1300 place count 1980 transition count 3360
Iterating global reduction 4 with 40 rules applied. Total rules applied 1340 place count 1980 transition count 3360
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 1380 place count 1940 transition count 3320
Iterating global reduction 4 with 40 rules applied. Total rules applied 1420 place count 1940 transition count 3320
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1440 place count 1920 transition count 3300
Iterating global reduction 4 with 20 rules applied. Total rules applied 1460 place count 1920 transition count 3300
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 1700 place count 1800 transition count 3180
Applied a total of 1700 rules in 310 ms. Remains 1800 /2640 variables (removed 840) and now considering 3180/4040 (removed 860) transitions.
// Phase 1: matrix 3180 rows 1800 cols
[2022-05-16 02:28:33] [INFO ] Computed 20 place invariants in 19 ms
[2022-05-16 02:28:33] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 3180 rows 1800 cols
[2022-05-16 02:28:33] [INFO ] Computed 20 place invariants in 14 ms
[2022-05-16 02:28:34] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
[2022-05-16 02:28:35] [INFO ] Redundant transitions in 158 ms returned []
// Phase 1: matrix 3180 rows 1800 cols
[2022-05-16 02:28:35] [INFO ] Computed 20 place invariants in 23 ms
[2022-05-16 02:28:36] [INFO ] Dead Transitions using invariants and state equation in 1436 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 1800/2640 places, 3180/4040 transitions.
Finished structural reductions, in 1 iterations. Remains : 1800/2640 places, 3180/4040 transitions.
[2022-05-16 02:28:36] [INFO ] Flatten gal took : 44 ms
[2022-05-16 02:28:36] [INFO ] Flatten gal took : 49 ms
[2022-05-16 02:28:36] [INFO ] Input system was already deterministic with 3180 transitions.
[2022-05-16 02:28:36] [INFO ] Flatten gal took : 45 ms
[2022-05-16 02:28:36] [INFO ] Flatten gal took : 47 ms
[2022-05-16 02:28:36] [INFO ] Time to serialize gal into /tmp/CTLFireability1458589451524753015.gal : 5 ms
[2022-05-16 02:28:36] [INFO ] Time to serialize properties into /tmp/CTLFireability2621137109467645734.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/CTLFireability1458589451524753015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2621137109467645734.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,1.21577e+39,2.72574,40400,2,3584,5,39768,6,0,10383,33353,0


Converting to forward existential form...Done !
original formula: A(AG(((((((TrainState_10_0_0==1)||(TrainState_9_0_0==1))||((TrainState_13_0_0==1)||(TrainState_8_0_0==1)))||(((TrainState_4_0_0==1)||(Tra...47179
=> equivalent forward existential formula: [((Init * !(EG(!(((((((((((((TrainState_6_1_31==1)||(TrainState_6_2_35==1))||((TrainState_15_2_37==1)||(TrainSta...140556
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-16 02:29:06] [INFO ] Flatten gal took : 92 ms
[2022-05-16 02:29:06] [INFO ] Applying decomposition
[2022-05-16 02:29:07] [INFO ] Flatten gal took : 105 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/graph14871867464667907667.txt' '-o' '/tmp/graph14871867464667907667.bin' '-w' '/tmp/graph14871867464667907667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14871867464667907667.bin' '-l' '-1' '-v' '-w' '/tmp/graph14871867464667907667.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:29:07] [INFO ] Decomposing Gal with order
[2022-05-16 02:29:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:29:07] [INFO ] Removed a total of 440 redundant transitions.
[2022-05-16 02:29:07] [INFO ] Flatten gal took : 115 ms
[2022-05-16 02:29:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-16 02:29:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14624612557144720666.gal : 8 ms
[2022-05-16 02:29:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10797674360343648963.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/CTLFireability14624612557144720666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10797674360343648963.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...255
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.21577e+39,0.703099,22408,72,89,890,1923,355,863,270,1444,0


Converting to forward existential form...Done !
original formula: A(AG(((((((i4.u4.TrainState_10_0_0==1)||(i14.u14.TrainState_9_0_0==1))||((i15.u15.TrainState_13_0_0==1)||(i13.u13.TrainState_8_0_0==1)))|...60859
=> equivalent forward existential formula: [((Init * !(EG(!(((((((((((((i11.u11.TrainState_6_1_31==1)||(i11.u408.TrainState_6_2_35==1))||((i19.u423.TrainSt...181316
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,1.51344,23112,1,0,1222,5357,10313,1023,1933,4143,6322
FORMULA BART-PT-020-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 640 places :
Symmetric choice reduction at 0 with 640 rule applications. Total rules 640 place count 2000 transition count 3400
Iterating global reduction 0 with 640 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1820 place count 1460 transition count 2860
Iterating global reduction 0 with 540 rules applied. Total rules applied 2360 place count 1460 transition count 2860
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2440 place count 1380 transition count 2780
Iterating global reduction 0 with 80 rules applied. Total rules applied 2520 place count 1380 transition count 2780
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2580 place count 1320 transition count 2720
Iterating global reduction 0 with 60 rules applied. Total rules applied 2640 place count 1320 transition count 2720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2700 place count 1260 transition count 2660
Iterating global reduction 0 with 60 rules applied. Total rules applied 2760 place count 1260 transition count 2660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2820 place count 1200 transition count 2600
Iterating global reduction 0 with 60 rules applied. Total rules applied 2880 place count 1200 transition count 2600
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2940 place count 1140 transition count 2540
Iterating global reduction 0 with 60 rules applied. Total rules applied 3000 place count 1140 transition count 2540
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3060 place count 1080 transition count 2480
Iterating global reduction 0 with 60 rules applied. Total rules applied 3120 place count 1080 transition count 2480
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3160 place count 1040 transition count 2440
Iterating global reduction 0 with 40 rules applied. Total rules applied 3200 place count 1040 transition count 2440
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3240 place count 1000 transition count 2400
Iterating global reduction 0 with 40 rules applied. Total rules applied 3280 place count 1000 transition count 2400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3300 place count 980 transition count 2380
Iterating global reduction 0 with 20 rules applied. Total rules applied 3320 place count 980 transition count 2380
Applied a total of 3320 rules in 946 ms. Remains 980 /2640 variables (removed 1660) and now considering 2380/4040 (removed 1660) transitions.
// Phase 1: matrix 2380 rows 980 cols
[2022-05-16 02:29:10] [INFO ] Computed 20 place invariants in 13 ms
[2022-05-16 02:29:10] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 2380 rows 980 cols
[2022-05-16 02:29:10] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-16 02:29:10] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
// Phase 1: matrix 2380 rows 980 cols
[2022-05-16 02:29:10] [INFO ] Computed 20 place invariants in 12 ms
[2022-05-16 02:29:11] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 980/2640 places, 2380/4040 transitions.
Finished structural reductions, in 1 iterations. Remains : 980/2640 places, 2380/4040 transitions.
[2022-05-16 02:29:11] [INFO ] Flatten gal took : 32 ms
[2022-05-16 02:29:11] [INFO ] Flatten gal took : 33 ms
[2022-05-16 02:29:11] [INFO ] Input system was already deterministic with 2380 transitions.
[2022-05-16 02:29:11] [INFO ] Flatten gal took : 33 ms
[2022-05-16 02:29:11] [INFO ] Flatten gal took : 33 ms
[2022-05-16 02:29:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12501142718774333061.gal : 4 ms
[2022-05-16 02:29:11] [INFO ] Time to serialize properties into /tmp/CTLFireability5179659656096673755.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/CTLFireability12501142718774333061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5179659656096673755.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,6.36681e+33,1.30873,22744,2,1946,5,15308,6,0,6303,8251,0


Converting to forward existential form...Done !
original formula: AX(AG(A(((!((TrainState_7_1_38==1)&&(TrainState_14_0_0==1)))&&(TrainState_8_1_32==1)) U EF((TrainState_13_1_21!=1)))))
=> equivalent forward existential formula: ([((FwdU(FwdU(EY(Init),TRUE),!(E(TRUE U (TrainState_13_1_21!=1)))) * !(((!((TrainState_7_1_38==1)&&(TrainState_1...318
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,9.24168,177152,1,0,7,970772,21,0,28085,20971,10
FORMULA BART-PT-020-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 636 places :
Symmetric choice reduction at 0 with 636 rule applications. Total rules 636 place count 2004 transition count 3404
Iterating global reduction 0 with 636 rules applied. Total rules applied 1272 place count 2004 transition count 3404
Discarding 533 places :
Symmetric choice reduction at 0 with 533 rule applications. Total rules 1805 place count 1471 transition count 2871
Iterating global reduction 0 with 533 rules applied. Total rules applied 2338 place count 1471 transition count 2871
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2418 place count 1391 transition count 2791
Iterating global reduction 0 with 80 rules applied. Total rules applied 2498 place count 1391 transition count 2791
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2558 place count 1331 transition count 2731
Iterating global reduction 0 with 60 rules applied. Total rules applied 2618 place count 1331 transition count 2731
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2678 place count 1271 transition count 2671
Iterating global reduction 0 with 60 rules applied. Total rules applied 2738 place count 1271 transition count 2671
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2798 place count 1211 transition count 2611
Iterating global reduction 0 with 60 rules applied. Total rules applied 2858 place count 1211 transition count 2611
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2917 place count 1152 transition count 2552
Iterating global reduction 0 with 59 rules applied. Total rules applied 2976 place count 1152 transition count 2552
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 3034 place count 1094 transition count 2494
Iterating global reduction 0 with 58 rules applied. Total rules applied 3092 place count 1094 transition count 2494
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3131 place count 1055 transition count 2455
Iterating global reduction 0 with 39 rules applied. Total rules applied 3170 place count 1055 transition count 2455
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 3208 place count 1017 transition count 2417
Iterating global reduction 0 with 38 rules applied. Total rules applied 3246 place count 1017 transition count 2417
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 3264 place count 999 transition count 2399
Iterating global reduction 0 with 18 rules applied. Total rules applied 3282 place count 999 transition count 2399
Applied a total of 3282 rules in 477 ms. Remains 999 /2640 variables (removed 1641) and now considering 2399/4040 (removed 1641) transitions.
// Phase 1: matrix 2399 rows 999 cols
[2022-05-16 02:29:21] [INFO ] Computed 20 place invariants in 14 ms
[2022-05-16 02:29:21] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 2399 rows 999 cols
[2022-05-16 02:29:21] [INFO ] Computed 20 place invariants in 12 ms
[2022-05-16 02:29:22] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
// Phase 1: matrix 2399 rows 999 cols
[2022-05-16 02:29:22] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-16 02:29:23] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 999/2640 places, 2399/4040 transitions.
Finished structural reductions, in 1 iterations. Remains : 999/2640 places, 2399/4040 transitions.
[2022-05-16 02:29:23] [INFO ] Flatten gal took : 30 ms
[2022-05-16 02:29:23] [INFO ] Flatten gal took : 30 ms
[2022-05-16 02:29:23] [INFO ] Input system was already deterministic with 2399 transitions.
[2022-05-16 02:29:23] [INFO ] Flatten gal took : 29 ms
[2022-05-16 02:29:23] [INFO ] Flatten gal took : 29 ms
[2022-05-16 02:29:23] [INFO ] Time to serialize gal into /tmp/CTLFireability8596889497003434599.gal : 5 ms
[2022-05-16 02:29:23] [INFO ] Time to serialize properties into /tmp/CTLFireability4012089265520816232.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/CTLFireability8596889497003434599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4012089265520816232.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,9.15265e+33,1.2377,23072,2,1979,5,15878,6,0,6398,8682,0


Converting to forward existential form...Done !
original formula: (A(((((TrainState_18_1_11==1) * AF((TrainState_5_0_0==1))) * (EX((TrainState_2_1_39==1)) * (TrainState_9_1_38!=1))) * (((TrainState_4_2_3...683
=> equivalent forward existential formula: ([((Init * !(EG(!(E((((TrainState_16_0_0==1) * (E((TrainState_1_1_21==1) U (TrainState_19_0_0==1)) + (TrainState...1606
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2395/0/4
Hit Full ! (commute/partial/dont) 2362/0/37
Using saturation style SCC detection
(forward)formula 0,1,11.9926,264512,1,0,102,1.62581e+06,61,65,30019,610962,81
FORMULA BART-PT-020-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 639 places :
Symmetric choice reduction at 0 with 639 rule applications. Total rules 639 place count 2001 transition count 3401
Iterating global reduction 0 with 639 rules applied. Total rules applied 1278 place count 2001 transition count 3401
Discarding 539 places :
Symmetric choice reduction at 0 with 539 rule applications. Total rules 1817 place count 1462 transition count 2862
Iterating global reduction 0 with 539 rules applied. Total rules applied 2356 place count 1462 transition count 2862
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2436 place count 1382 transition count 2782
Iterating global reduction 0 with 80 rules applied. Total rules applied 2516 place count 1382 transition count 2782
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2576 place count 1322 transition count 2722
Iterating global reduction 0 with 60 rules applied. Total rules applied 2636 place count 1322 transition count 2722
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2696 place count 1262 transition count 2662
Iterating global reduction 0 with 60 rules applied. Total rules applied 2756 place count 1262 transition count 2662
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2816 place count 1202 transition count 2602
Iterating global reduction 0 with 60 rules applied. Total rules applied 2876 place count 1202 transition count 2602
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2936 place count 1142 transition count 2542
Iterating global reduction 0 with 60 rules applied. Total rules applied 2996 place count 1142 transition count 2542
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3056 place count 1082 transition count 2482
Iterating global reduction 0 with 60 rules applied. Total rules applied 3116 place count 1082 transition count 2482
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3156 place count 1042 transition count 2442
Iterating global reduction 0 with 40 rules applied. Total rules applied 3196 place count 1042 transition count 2442
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3235 place count 1003 transition count 2403
Iterating global reduction 0 with 39 rules applied. Total rules applied 3274 place count 1003 transition count 2403
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 3293 place count 984 transition count 2384
Iterating global reduction 0 with 19 rules applied. Total rules applied 3312 place count 984 transition count 2384
Applied a total of 3312 rules in 338 ms. Remains 984 /2640 variables (removed 1656) and now considering 2384/4040 (removed 1656) transitions.
// Phase 1: matrix 2384 rows 984 cols
[2022-05-16 02:29:35] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-16 02:29:35] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 2384 rows 984 cols
[2022-05-16 02:29:35] [INFO ] Computed 20 place invariants in 10 ms
[2022-05-16 02:29:36] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
// Phase 1: matrix 2384 rows 984 cols
[2022-05-16 02:29:36] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-16 02:29:37] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 984/2640 places, 2384/4040 transitions.
Finished structural reductions, in 1 iterations. Remains : 984/2640 places, 2384/4040 transitions.
[2022-05-16 02:29:37] [INFO ] Flatten gal took : 33 ms
[2022-05-16 02:29:37] [INFO ] Flatten gal took : 34 ms
[2022-05-16 02:29:37] [INFO ] Input system was already deterministic with 2384 transitions.
[2022-05-16 02:29:37] [INFO ] Flatten gal took : 33 ms
[2022-05-16 02:29:37] [INFO ] Flatten gal took : 33 ms
[2022-05-16 02:29:37] [INFO ] Time to serialize gal into /tmp/CTLFireability9579747770490451562.gal : 4 ms
[2022-05-16 02:29:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3025126010889241891.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/CTLFireability9579747770490451562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3025126010889241891.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,6.8945e+33,1.17381,22684,2,1949,5,15396,6,0,6323,8332,0


Converting to forward existential form...Done !
original formula: A(!(EX((TrainState_10_4_32==1))) U (TrainState_18_2_39==1))
=> equivalent forward existential formula: [((Init * !(EG(!((TrainState_18_2_39==1))))) * !(E(!((TrainState_18_2_39==1)) U (!(!(EX((TrainState_10_4_32==1))...200
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2382/0/2
(forward)formula 0,0,7.58598,171124,1,0,10,1.00349e+06,21,4,26262,46611,11
FORMULA BART-PT-020-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 637 places :
Symmetric choice reduction at 0 with 637 rule applications. Total rules 637 place count 2003 transition count 3403
Iterating global reduction 0 with 637 rules applied. Total rules applied 1274 place count 2003 transition count 3403
Discarding 537 places :
Symmetric choice reduction at 0 with 537 rule applications. Total rules 1811 place count 1466 transition count 2866
Iterating global reduction 0 with 537 rules applied. Total rules applied 2348 place count 1466 transition count 2866
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 2426 place count 1388 transition count 2788
Iterating global reduction 0 with 78 rules applied. Total rules applied 2504 place count 1388 transition count 2788
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 2562 place count 1330 transition count 2730
Iterating global reduction 0 with 58 rules applied. Total rules applied 2620 place count 1330 transition count 2730
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 2678 place count 1272 transition count 2672
Iterating global reduction 0 with 58 rules applied. Total rules applied 2736 place count 1272 transition count 2672
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 2794 place count 1214 transition count 2614
Iterating global reduction 0 with 58 rules applied. Total rules applied 2852 place count 1214 transition count 2614
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 2910 place count 1156 transition count 2556
Iterating global reduction 0 with 58 rules applied. Total rules applied 2968 place count 1156 transition count 2556
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 3026 place count 1098 transition count 2498
Iterating global reduction 0 with 58 rules applied. Total rules applied 3084 place count 1098 transition count 2498
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 3122 place count 1060 transition count 2460
Iterating global reduction 0 with 38 rules applied. Total rules applied 3160 place count 1060 transition count 2460
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 3197 place count 1023 transition count 2423
Iterating global reduction 0 with 37 rules applied. Total rules applied 3234 place count 1023 transition count 2423
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 3253 place count 1004 transition count 2404
Iterating global reduction 0 with 19 rules applied. Total rules applied 3272 place count 1004 transition count 2404
Applied a total of 3272 rules in 380 ms. Remains 1004 /2640 variables (removed 1636) and now considering 2404/4040 (removed 1636) transitions.
// Phase 1: matrix 2404 rows 1004 cols
[2022-05-16 02:29:45] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-16 02:29:45] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 2404 rows 1004 cols
[2022-05-16 02:29:45] [INFO ] Computed 20 place invariants in 14 ms
[2022-05-16 02:29:46] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
// Phase 1: matrix 2404 rows 1004 cols
[2022-05-16 02:29:46] [INFO ] Computed 20 place invariants in 12 ms
[2022-05-16 02:29:47] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1004/2640 places, 2404/4040 transitions.
Finished structural reductions, in 1 iterations. Remains : 1004/2640 places, 2404/4040 transitions.
[2022-05-16 02:29:47] [INFO ] Flatten gal took : 35 ms
[2022-05-16 02:29:47] [INFO ] Flatten gal took : 33 ms
[2022-05-16 02:29:47] [INFO ] Input system was already deterministic with 2404 transitions.
[2022-05-16 02:29:47] [INFO ] Flatten gal took : 34 ms
[2022-05-16 02:29:47] [INFO ] Flatten gal took : 34 ms
[2022-05-16 02:29:47] [INFO ] Time to serialize gal into /tmp/CTLFireability10465693465707630233.gal : 4 ms
[2022-05-16 02:29:47] [INFO ] Time to serialize properties into /tmp/CTLFireability16093802611653370304.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/CTLFireability10465693465707630233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16093802611653370304.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,1.00581e+34,1.33404,23252,2,1989,5,15944,6,0,6423,8750,0


Converting to forward existential form...Done !
original formula: EG((A(E(EX((TrainState_7_0_0==1)) U !(((TrainState_5_2_28==1)&&(TrainState_16_1_34==1)))) U !((((TrainState_17_2_39==1) * EF((TrainState_...403
=> equivalent forward existential formula: [FwdG(Init,(!((E(!(!((((TrainState_17_2_39==1) * E(TRUE U (TrainState_7_1_32==1))) * !(EX(!((TrainState_6_1_15==...699
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,8.27181,186552,1,0,20,1.12666e+06,38,9,28673,132643,18
FORMULA BART-PT-020-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 638 places :
Symmetric choice reduction at 0 with 638 rule applications. Total rules 638 place count 2002 transition count 3402
Iterating global reduction 0 with 638 rules applied. Total rules applied 1276 place count 2002 transition count 3402
Discarding 535 places :
Symmetric choice reduction at 0 with 535 rule applications. Total rules 1811 place count 1467 transition count 2867
Iterating global reduction 0 with 535 rules applied. Total rules applied 2346 place count 1467 transition count 2867
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 2425 place count 1388 transition count 2788
Iterating global reduction 0 with 79 rules applied. Total rules applied 2504 place count 1388 transition count 2788
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2564 place count 1328 transition count 2728
Iterating global reduction 0 with 60 rules applied. Total rules applied 2624 place count 1328 transition count 2728
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2684 place count 1268 transition count 2668
Iterating global reduction 0 with 60 rules applied. Total rules applied 2744 place count 1268 transition count 2668
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2804 place count 1208 transition count 2608
Iterating global reduction 0 with 60 rules applied. Total rules applied 2864 place count 1208 transition count 2608
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2923 place count 1149 transition count 2549
Iterating global reduction 0 with 59 rules applied. Total rules applied 2982 place count 1149 transition count 2549
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 3041 place count 1090 transition count 2490
Iterating global reduction 0 with 59 rules applied. Total rules applied 3100 place count 1090 transition count 2490
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3139 place count 1051 transition count 2451
Iterating global reduction 0 with 39 rules applied. Total rules applied 3178 place count 1051 transition count 2451
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 3216 place count 1013 transition count 2413
Iterating global reduction 0 with 38 rules applied. Total rules applied 3254 place count 1013 transition count 2413
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 3273 place count 994 transition count 2394
Iterating global reduction 0 with 19 rules applied. Total rules applied 3292 place count 994 transition count 2394
Applied a total of 3292 rules in 430 ms. Remains 994 /2640 variables (removed 1646) and now considering 2394/4040 (removed 1646) transitions.
// Phase 1: matrix 2394 rows 994 cols
[2022-05-16 02:29:56] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-16 02:29:56] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 2394 rows 994 cols
[2022-05-16 02:29:56] [INFO ] Computed 20 place invariants in 10 ms
[2022-05-16 02:29:56] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
// Phase 1: matrix 2394 rows 994 cols
[2022-05-16 02:29:56] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-16 02:29:57] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 994/2640 places, 2394/4040 transitions.
Finished structural reductions, in 1 iterations. Remains : 994/2640 places, 2394/4040 transitions.
[2022-05-16 02:29:57] [INFO ] Flatten gal took : 32 ms
[2022-05-16 02:29:57] [INFO ] Flatten gal took : 34 ms
[2022-05-16 02:29:57] [INFO ] Input system was already deterministic with 2394 transitions.
[2022-05-16 02:29:57] [INFO ] Flatten gal took : 32 ms
[2022-05-16 02:29:57] [INFO ] Flatten gal took : 33 ms
[2022-05-16 02:29:57] [INFO ] Time to serialize gal into /tmp/CTLFireability12549106770767564090.gal : 4 ms
[2022-05-16 02:29:57] [INFO ] Time to serialize properties into /tmp/CTLFireability12970967075064155913.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/CTLFireability12549106770767564090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12970967075064155913.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,8.35404e+33,1.34172,23208,2,2164,5,18420,6,0,6373,9751,0


Converting to forward existential form...Done !
original formula: E(AX((TrainState_8_0_0==1)) U ((AG(EX(EX((TrainState_15_3_37==1)))) * A((EF((TrainState_9_1_8==1)) + (TrainState_7_2_27==1)) U A((TrainSt...339
=> equivalent forward existential formula: ([((FwdU(Init,!(EX(!((TrainState_8_0_0==1))))) * (!(E(TRUE U !(EX(EX((TrainState_15_3_37==1)))))) * !((E(!(!((E(...1821
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2388/6/6
Using saturation style SCC detection
(forward)formula 0,0,9.89589,196144,1,0,19,1.09848e+06,44,4,30223,81968,22
FORMULA BART-PT-020-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 3804 edges and 2640 vertex of which 1905 / 2640 are part of one of the 15 SCC in 11 ms
Free SCC test removed 1890 places
Ensure Unique test removed 2905 transitions
Reduce isomorphic transitions removed 2905 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 353 rules applied. Total rules applied 354 place count 744 transition count 782
Reduce places removed 348 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 356 rules applied. Total rules applied 710 place count 396 transition count 774
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 719 place count 392 transition count 769
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 725 place count 390 transition count 765
Reduce places removed 2 places and 0 transitions.
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 4 with 5 rules applied. Total rules applied 730 place count 388 transition count 762
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 3 rules applied. Total rules applied 733 place count 387 transition count 760
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 6 with 3 rules applied. Total rules applied 736 place count 386 transition count 758
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 7 with 16 rules applied. Total rules applied 752 place count 385 transition count 743
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 772 place count 371 transition count 737
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 26 Pre rules applied. Total rules applied 772 place count 371 transition count 711
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 9 with 52 rules applied. Total rules applied 824 place count 345 transition count 711
Discarding 32 places :
Symmetric choice reduction at 9 with 32 rule applications. Total rules 856 place count 313 transition count 679
Iterating global reduction 9 with 32 rules applied. Total rules applied 888 place count 313 transition count 679
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 9 with 9 rules applied. Total rules applied 897 place count 313 transition count 670
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 899 place count 312 transition count 669
Discarding 20 places :
Symmetric choice reduction at 11 with 20 rule applications. Total rules 919 place count 292 transition count 649
Iterating global reduction 11 with 20 rules applied. Total rules applied 939 place count 292 transition count 649
Discarding 15 places :
Symmetric choice reduction at 11 with 15 rule applications. Total rules 954 place count 277 transition count 634
Iterating global reduction 11 with 15 rules applied. Total rules applied 969 place count 277 transition count 634
Discarding 15 places :
Symmetric choice reduction at 11 with 15 rule applications. Total rules 984 place count 262 transition count 619
Iterating global reduction 11 with 15 rules applied. Total rules applied 999 place count 262 transition count 619
Discarding 10 places :
Symmetric choice reduction at 11 with 10 rule applications. Total rules 1009 place count 252 transition count 609
Iterating global reduction 11 with 10 rules applied. Total rules applied 1019 place count 252 transition count 609
Discarding 10 places :
Symmetric choice reduction at 11 with 10 rule applications. Total rules 1029 place count 242 transition count 599
Iterating global reduction 11 with 10 rules applied. Total rules applied 1039 place count 242 transition count 599
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1044 place count 237 transition count 594
Iterating global reduction 11 with 5 rules applied. Total rules applied 1049 place count 237 transition count 594
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 11 with 60 rules applied. Total rules applied 1109 place count 207 transition count 564
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1119 place count 207 transition count 554
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 1129 place count 202 transition count 549
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 1139 place count 202 transition count 539
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 13 with 10 rules applied. Total rules applied 1149 place count 197 transition count 534
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 1159 place count 197 transition count 524
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 1169 place count 192 transition count 519
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 1179 place count 192 transition count 509
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 15 with 10 rules applied. Total rules applied 1189 place count 187 transition count 504
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 1199 place count 187 transition count 494
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 16 with 10 rules applied. Total rules applied 1209 place count 182 transition count 489
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 1219 place count 182 transition count 479
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 17 with 10 rules applied. Total rules applied 1229 place count 177 transition count 474
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 17 with 10 rules applied. Total rules applied 1239 place count 177 transition count 464
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 18 with 10 rules applied. Total rules applied 1249 place count 172 transition count 459
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 18 with 10 rules applied. Total rules applied 1259 place count 172 transition count 449
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 19 with 10 rules applied. Total rules applied 1269 place count 167 transition count 444
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 19 with 10 rules applied. Total rules applied 1279 place count 167 transition count 434
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 20 with 10 rules applied. Total rules applied 1289 place count 162 transition count 429
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 20 with 9 rules applied. Total rules applied 1298 place count 162 transition count 420
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 1306 place count 158 transition count 416
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 21 with 8 rules applied. Total rules applied 1314 place count 158 transition count 408
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 22 with 6 rules applied. Total rules applied 1320 place count 155 transition count 405
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 1326 place count 155 transition count 399
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 23 with 6 rules applied. Total rules applied 1332 place count 152 transition count 396
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 1338 place count 152 transition count 390
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 24 with 6 rules applied. Total rules applied 1344 place count 149 transition count 387
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 1350 place count 149 transition count 381
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 25 with 6 rules applied. Total rules applied 1356 place count 146 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 25 with 6 rules applied. Total rules applied 1362 place count 146 transition count 372
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 26 with 6 rules applied. Total rules applied 1368 place count 143 transition count 369
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 26 with 6 rules applied. Total rules applied 1374 place count 143 transition count 363
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 27 with 6 rules applied. Total rules applied 1380 place count 140 transition count 360
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 27 with 6 rules applied. Total rules applied 1386 place count 140 transition count 354
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 28 with 6 rules applied. Total rules applied 1392 place count 137 transition count 351
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 28 with 6 rules applied. Total rules applied 1398 place count 137 transition count 345
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 29 with 6 rules applied. Total rules applied 1404 place count 134 transition count 342
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 29 with 6 rules applied. Total rules applied 1410 place count 134 transition count 336
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 30 with 6 rules applied. Total rules applied 1416 place count 131 transition count 333
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 30 with 6 rules applied. Total rules applied 1422 place count 131 transition count 327
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 31 with 6 rules applied. Total rules applied 1428 place count 128 transition count 324
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 31 with 6 rules applied. Total rules applied 1434 place count 128 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 32 with 6 rules applied. Total rules applied 1440 place count 125 transition count 315
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 32 with 6 rules applied. Total rules applied 1446 place count 125 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 33 with 6 rules applied. Total rules applied 1452 place count 122 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 33 with 6 rules applied. Total rules applied 1458 place count 122 transition count 300
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 34 with 6 rules applied. Total rules applied 1464 place count 119 transition count 297
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 34 with 6 rules applied. Total rules applied 1470 place count 119 transition count 291
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 35 with 6 rules applied. Total rules applied 1476 place count 116 transition count 288
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 35 with 6 rules applied. Total rules applied 1482 place count 116 transition count 282
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 36 with 6 rules applied. Total rules applied 1488 place count 113 transition count 279
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 36 with 6 rules applied. Total rules applied 1494 place count 113 transition count 273
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 37 with 6 rules applied. Total rules applied 1500 place count 110 transition count 270
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 37 with 6 rules applied. Total rules applied 1506 place count 110 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 38 with 4 rules applied. Total rules applied 1510 place count 108 transition count 262
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 1514 place count 108 transition count 258
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 39 with 4 rules applied. Total rules applied 1518 place count 106 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 1522 place count 106 transition count 252
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 40 with 4 rules applied. Total rules applied 1526 place count 104 transition count 250
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 40 with 4 rules applied. Total rules applied 1530 place count 104 transition count 246
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 41 with 4 rules applied. Total rules applied 1534 place count 102 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 41 with 4 rules applied. Total rules applied 1538 place count 102 transition count 240
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 42 with 4 rules applied. Total rules applied 1542 place count 100 transition count 238
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 42 with 4 rules applied. Total rules applied 1546 place count 100 transition count 234
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 43 with 4 rules applied. Total rules applied 1550 place count 98 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 43 with 4 rules applied. Total rules applied 1554 place count 98 transition count 228
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 44 with 4 rules applied. Total rules applied 1558 place count 96 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 44 with 6 rules applied. Total rules applied 1564 place count 96 transition count 220
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 45 with 4 rules applied. Total rules applied 1568 place count 94 transition count 218
Drop transitions removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 46 with 87 rules applied. Total rules applied 1655 place count 94 transition count 131
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 46 with 23 rules applied. Total rules applied 1678 place count 94 transition count 108
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 47 with 24 rules applied. Total rules applied 1702 place count 71 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 48 with 1 rules applied. Total rules applied 1703 place count 70 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 49 with 4 Pre rules applied. Total rules applied 1703 place count 70 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 49 with 8 rules applied. Total rules applied 1711 place count 66 transition count 103
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 49 with 14 rules applied. Total rules applied 1725 place count 66 transition count 89
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 49 with 10 rules applied. Total rules applied 1735 place count 66 transition count 79
Reduce places removed 10 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 50 with 13 rules applied. Total rules applied 1748 place count 56 transition count 76
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 51 with 3 rules applied. Total rules applied 1751 place count 53 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 52 with 1 Pre rules applied. Total rules applied 1751 place count 53 transition count 75
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 52 with 2 rules applied. Total rules applied 1753 place count 52 transition count 75
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 52 with 6 rules applied. Total rules applied 1759 place count 52 transition count 69
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 52 with 3 rules applied. Total rules applied 1762 place count 52 transition count 66
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 53 with 5 rules applied. Total rules applied 1767 place count 49 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 54 with 2 rules applied. Total rules applied 1769 place count 47 transition count 64
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 55 with 1 Pre rules applied. Total rules applied 1769 place count 47 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 55 with 2 rules applied. Total rules applied 1771 place count 46 transition count 63
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 55 with 2 rules applied. Total rules applied 1773 place count 46 transition count 61
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 55 with 1 rules applied. Total rules applied 1774 place count 46 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 56 with 1 rules applied. Total rules applied 1775 place count 45 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 57 with 1 Pre rules applied. Total rules applied 1775 place count 45 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 57 with 2 rules applied. Total rules applied 1777 place count 44 transition count 59
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 57 with 6 rules applied. Total rules applied 1783 place count 44 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 57 with 1 rules applied. Total rules applied 1784 place count 44 transition count 58
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 58 with 2 rules applied. Total rules applied 1786 place count 44 transition count 56
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 58 with 1 rules applied. Total rules applied 1787 place count 44 transition count 56
Applied a total of 1787 rules in 147 ms. Remains 44 /2640 variables (removed 2596) and now considering 56/4040 (removed 3984) transitions.
// Phase 1: matrix 56 rows 44 cols
[2022-05-16 02:30:08] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-16 02:30:08] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 56 rows 44 cols
[2022-05-16 02:30:08] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-16 02:30:08] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-16 02:30:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 56 rows 44 cols
[2022-05-16 02:30:08] [INFO ] Computed 14 place invariants in 8 ms
[2022-05-16 02:30:08] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 44/2640 places, 56/4040 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/2640 places, 56/4040 transitions.
[2022-05-16 02:30:08] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:30:08] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:30:08] [INFO ] Input system was already deterministic with 56 transitions.
[2022-05-16 02:30:08] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:30:08] [INFO ] Flatten gal took : 1 ms
[2022-05-16 02:30:08] [INFO ] Time to serialize gal into /tmp/CTLFireability3161939301912316322.gal : 0 ms
[2022-05-16 02:30:08] [INFO ] Time to serialize properties into /tmp/CTLFireability13137639255487299986.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/CTLFireability3161939301912316322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13137639255487299986.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.03219e+06,0.007899,4548,2,75,5,351,5,0,233,229,0


Converting to forward existential form...Done !
original formula: E(A(((((TrainState_14_3_36==1) + !((EF((TrainState_2_1_29==1)) + (TrainState_4_2_20==1)))) + ((!((TrainState_9_2_32==1)||(TrainState_6_1_...643
=> equivalent forward existential formula: ([((FwdU(Init,!((E(!(!((E(!(((!((TrainState_5_0_0==1)||(TrainState_1_1_9==1)))&&(TrainState_12_2_19==1))) U (!(!...3875
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 53/0/3
Hit Full ! (commute/partial/dont) 51/0/5
Hit Full ! (commute/partial/dont) 49/0/7
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 53/0/3
(forward)formula 0,0,0.071024,6804,1,0,46,7408,87,29,1150,8419,60
FORMULA BART-PT-020-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 633 places :
Symmetric choice reduction at 0 with 633 rule applications. Total rules 633 place count 2007 transition count 3407
Iterating global reduction 0 with 633 rules applied. Total rules applied 1266 place count 2007 transition count 3407
Discarding 530 places :
Symmetric choice reduction at 0 with 530 rule applications. Total rules 1796 place count 1477 transition count 2877
Iterating global reduction 0 with 530 rules applied. Total rules applied 2326 place count 1477 transition count 2877
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 2405 place count 1398 transition count 2798
Iterating global reduction 0 with 79 rules applied. Total rules applied 2484 place count 1398 transition count 2798
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2543 place count 1339 transition count 2739
Iterating global reduction 0 with 59 rules applied. Total rules applied 2602 place count 1339 transition count 2739
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2661 place count 1280 transition count 2680
Iterating global reduction 0 with 59 rules applied. Total rules applied 2720 place count 1280 transition count 2680
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2779 place count 1221 transition count 2621
Iterating global reduction 0 with 59 rules applied. Total rules applied 2838 place count 1221 transition count 2621
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2897 place count 1162 transition count 2562
Iterating global reduction 0 with 59 rules applied. Total rules applied 2956 place count 1162 transition count 2562
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 3015 place count 1103 transition count 2503
Iterating global reduction 0 with 59 rules applied. Total rules applied 3074 place count 1103 transition count 2503
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 3112 place count 1065 transition count 2465
Iterating global reduction 0 with 38 rules applied. Total rules applied 3150 place count 1065 transition count 2465
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 3188 place count 1027 transition count 2427
Iterating global reduction 0 with 38 rules applied. Total rules applied 3226 place count 1027 transition count 2427
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 3245 place count 1008 transition count 2408
Iterating global reduction 0 with 19 rules applied. Total rules applied 3264 place count 1008 transition count 2408
Applied a total of 3264 rules in 337 ms. Remains 1008 /2640 variables (removed 1632) and now considering 2408/4040 (removed 1632) transitions.
// Phase 1: matrix 2408 rows 1008 cols
[2022-05-16 02:30:08] [INFO ] Computed 20 place invariants in 10 ms
[2022-05-16 02:30:08] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 2408 rows 1008 cols
[2022-05-16 02:30:08] [INFO ] Computed 20 place invariants in 12 ms
[2022-05-16 02:30:09] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
// Phase 1: matrix 2408 rows 1008 cols
[2022-05-16 02:30:09] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-16 02:30:10] [INFO ] Dead Transitions using invariants and state equation in 908 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1008/2640 places, 2408/4040 transitions.
Finished structural reductions, in 1 iterations. Remains : 1008/2640 places, 2408/4040 transitions.
[2022-05-16 02:30:10] [INFO ] Flatten gal took : 33 ms
[2022-05-16 02:30:10] [INFO ] Flatten gal took : 34 ms
[2022-05-16 02:30:10] [INFO ] Input system was already deterministic with 2408 transitions.
[2022-05-16 02:30:10] [INFO ] Flatten gal took : 34 ms
[2022-05-16 02:30:10] [INFO ] Flatten gal took : 35 ms
[2022-05-16 02:30:10] [INFO ] Time to serialize gal into /tmp/CTLFireability804360088410917554.gal : 6 ms
[2022-05-16 02:30:10] [INFO ] Time to serialize properties into /tmp/CTLFireability3746980362646059840.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/CTLFireability804360088410917554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3746980362646059840.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09427e+34,1.3384,23416,2,1997,5,16116,6,0,6443,9012,0


Converting to forward existential form...Done !
original formula: EG(((EF(EG((TrainState_19_4_29==0))) + AX(((((TrainState_10_1_22==0)||(TrainState_8_3_20==0))&&(TrainState_9_3_16==1)) * ((TrainState_11_...468
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U EG((TrainState_19_4_29==0))) + !(EX(!(((((TrainState_10_1_22==0)||(TrainState_8_3_20==0))&...697
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2406/0/2
Hit Full ! (commute/partial/dont) 2404/0/4
(forward)formula 0,1,12.5597,244316,1,0,71,1.42445e+06,72,45,30760,339035,68
FORMULA BART-PT-020-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 637 places :
Symmetric choice reduction at 0 with 637 rule applications. Total rules 637 place count 2003 transition count 3403
Iterating global reduction 0 with 637 rules applied. Total rules applied 1274 place count 2003 transition count 3403
Discarding 536 places :
Symmetric choice reduction at 0 with 536 rule applications. Total rules 1810 place count 1467 transition count 2867
Iterating global reduction 0 with 536 rules applied. Total rules applied 2346 place count 1467 transition count 2867
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2426 place count 1387 transition count 2787
Iterating global reduction 0 with 80 rules applied. Total rules applied 2506 place count 1387 transition count 2787
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2566 place count 1327 transition count 2727
Iterating global reduction 0 with 60 rules applied. Total rules applied 2626 place count 1327 transition count 2727
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2686 place count 1267 transition count 2667
Iterating global reduction 0 with 60 rules applied. Total rules applied 2746 place count 1267 transition count 2667
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2806 place count 1207 transition count 2607
Iterating global reduction 0 with 60 rules applied. Total rules applied 2866 place count 1207 transition count 2607
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2925 place count 1148 transition count 2548
Iterating global reduction 0 with 59 rules applied. Total rules applied 2984 place count 1148 transition count 2548
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 3043 place count 1089 transition count 2489
Iterating global reduction 0 with 59 rules applied. Total rules applied 3102 place count 1089 transition count 2489
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3142 place count 1049 transition count 2449
Iterating global reduction 0 with 40 rules applied. Total rules applied 3182 place count 1049 transition count 2449
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3221 place count 1010 transition count 2410
Iterating global reduction 0 with 39 rules applied. Total rules applied 3260 place count 1010 transition count 2410
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3280 place count 990 transition count 2390
Iterating global reduction 0 with 20 rules applied. Total rules applied 3300 place count 990 transition count 2390
Applied a total of 3300 rules in 454 ms. Remains 990 /2640 variables (removed 1650) and now considering 2390/4040 (removed 1650) transitions.
// Phase 1: matrix 2390 rows 990 cols
[2022-05-16 02:30:23] [INFO ] Computed 20 place invariants in 11 ms
[2022-05-16 02:30:23] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 2390 rows 990 cols
[2022-05-16 02:30:23] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-16 02:30:24] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
// Phase 1: matrix 2390 rows 990 cols
[2022-05-16 02:30:24] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-16 02:30:25] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 990/2640 places, 2390/4040 transitions.
Finished structural reductions, in 1 iterations. Remains : 990/2640 places, 2390/4040 transitions.
[2022-05-16 02:30:25] [INFO ] Flatten gal took : 31 ms
[2022-05-16 02:30:25] [INFO ] Flatten gal took : 31 ms
[2022-05-16 02:30:25] [INFO ] Input system was already deterministic with 2390 transitions.
[2022-05-16 02:30:25] [INFO ] Flatten gal took : 55 ms
[2022-05-16 02:30:25] [INFO ] Flatten gal took : 45 ms
[2022-05-16 02:30:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17562438151059817992.gal : 4 ms
[2022-05-16 02:30:25] [INFO ] Time to serialize properties into /tmp/CTLFireability5744351362896544661.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/CTLFireability17562438151059817992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5744351362896544661.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,7.75917e+33,1.26405,23136,2,2345,5,21380,6,0,6353,11208,0


Converting to forward existential form...Done !
original formula: AX((AF((!(A((TrainState_9_2_25==1) U (TrainState_10_0_0==1))) * (AF((TrainState_17_1_38==0)) + !(A((TrainState_10_4_26==1) U (TrainState_...263
=> equivalent forward existential formula: [FwdG((EY(Init) * !(E(TRUE U ((E(TRUE U (TrainState_20_2_10==0)) * (TrainState_16_0_0==1)) * EG((TrainState_5_2_...475
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2388/0/2
Hit Full ! (commute/partial/dont) 2353/0/37
(forward)formula 0,1,11.0164,205436,1,0,18,1.23624e+06,62,6,28230,71715,24
FORMULA BART-PT-020-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2022-05-16 02:30:36] [INFO ] Flatten gal took : 146 ms
[2022-05-16 02:30:36] [INFO ] Flatten gal took : 138 ms
[2022-05-16 02:30:36] [INFO ] Applying decomposition
[2022-05-16 02:30:37] [INFO ] Flatten gal took : 137 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/graph6478783581581733564.txt' '-o' '/tmp/graph6478783581581733564.bin' '-w' '/tmp/graph6478783581581733564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6478783581581733564.bin' '-l' '-1' '-v' '-w' '/tmp/graph6478783581581733564.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:30:37] [INFO ] Decomposing Gal with order
[2022-05-16 02:30:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:30:37] [INFO ] Removed a total of 343 redundant transitions.
[2022-05-16 02:30:37] [INFO ] Flatten gal took : 185 ms
[2022-05-16 02:30:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-16 02:30:42] [INFO ] Time to serialize gal into /tmp/CTLFireability2728228628922048003.gal : 16 ms
[2022-05-16 02:30:42] [INFO ] Time to serialize properties into /tmp/CTLFireability7785398205173196765.ctl : 22 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/CTLFireability2728228628922048003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7785398205173196765.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,2.57916e+42,1.37105,32020,841,75,17664,3231,2690,17312,253,2802,0


Converting to forward existential form...Done !
original formula: (EF(AG((((((((((((i12.i0.u117.TrainState_8_3_9==1)||(i13.i0.u70.TrainState_1_2_5==1))||((i12.i1.u169.TrainState_8_3_7==1)||(i12.i0.u103.T...460418
=> equivalent forward existential formula: (((([(EY(((FwdU((Init * !(E(TRUE U !(E(TRUE U !((((((((((((i12.i0.u117.TrainState_8_3_9==1)||(i13.i0.u70.TrainSt...1086084
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,920.431,12198144,1,0,2.69658e+07,8.71127e+06,32043,7.22921e+07,2916,2.72065e+07,3289195
FORMULA BART-PT-020-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1409169 ms.

BK_STOP 1652669165435

--------------------
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-PT-020"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BART-PT-020, 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-165245689600618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;