Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r485-tall-167912699900810.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is TwoPhaseLocking-PT-nC00020vN, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912699900810
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 8.2K Feb 25 17:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 17:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 17:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 17:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 17:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.6K Mar 5 18:23 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 TwoPhaseLocking-PT-nC00020vN-CTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC00020vN-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679286154940

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TwoPhaseLocking-PT-nC00020vN
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202303021504
[2023-03-20 04:22:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 04:22:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 04:22:36] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2023-03-20 04:22:36] [INFO ] Transformed 8 places.
[2023-03-20 04:22:36] [INFO ] Transformed 6 transitions.
[2023-03-20 04:22:36] [INFO ] Parsed PT model containing 8 places and 6 transitions and 18 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 8 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-20 04:22:36] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-20 04:22:36] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-20 04:22:36] [INFO ] Invariant cache hit.
[2023-03-20 04:22:36] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-20 04:22:36] [INFO ] Invariant cache hit.
[2023-03-20 04:22:36] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2023-03-20 04:22:37] [INFO ] Flatten gal took : 15 ms
[2023-03-20 04:22:37] [INFO ] Flatten gal took : 4 ms
[2023-03-20 04:22:37] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 65 steps, including 0 resets, run visited all 16 properties in 13 ms. (steps per millisecond=5 )
[2023-03-20 04:22:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 04:22:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 04:22:37] [INFO ] Input system was already deterministic with 6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 04:22:37] [INFO ] Invariant cache hit.
[2023-03-20 04:22:37] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 04:22:37] [INFO ] Invariant cache hit.
[2023-03-20 04:22:37] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-20 04:22:37] [INFO ] Invariant cache hit.
[2023-03-20 04:22:37] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 04:22:37] [INFO ] Flatten gal took : 2 ms
[2023-03-20 04:22:37] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:37] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 04:22:37] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:37] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:37] [INFO ] Time to serialize gal into /tmp/CTLFireability8006676520298505166.gal : 0 ms
[2023-03-20 04:22:37] [INFO ] Time to serialize properties into /tmp/CTLFireability18318860501083894496.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8006676520298505166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18318860501083894496.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7997,0.133294,7788,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: AG(EF(((haveAandB<1) + (EX((haveA2>=1)) * EF((haveAandB>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((haveAandB<1) + (EX((haveA2>=1)) * E(TRUE U (haveAandB>=1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.256314,9360,1,0,10,30830,16,2,263,30986,10
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 04:22:38] [INFO ] Invariant cache hit.
[2023-03-20 04:22:38] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 04:22:38] [INFO ] Invariant cache hit.
[2023-03-20 04:22:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-20 04:22:38] [INFO ] Invariant cache hit.
[2023-03-20 04:22:38] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 04:22:38] [INFO ] Flatten gal took : 2 ms
[2023-03-20 04:22:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:38] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 04:22:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:38] [INFO ] Flatten gal took : 0 ms
[2023-03-20 04:22:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2125857802018187767.gal : 1 ms
[2023-03-20 04:22:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11319368393763736569.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2125857802018187767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11319368393763736569.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7997,0.124775,7864,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: AX(EG(((haveA2<1) + EX(AX(((resA<1)||(Clients<1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((haveA2<1) + EX(!(EX(!(((resA<1)||(Clients<1))))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.428254,15784,1,0,11,62329,19,3,277,64125,9
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 04:22:38] [INFO ] Invariant cache hit.
[2023-03-20 04:22:38] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-20 04:22:38] [INFO ] Invariant cache hit.
[2023-03-20 04:22:38] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-20 04:22:38] [INFO ] Invariant cache hit.
[2023-03-20 04:22:38] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 04:22:38] [INFO ] Flatten gal took : 2 ms
[2023-03-20 04:22:38] [INFO ] Flatten gal took : 2 ms
[2023-03-20 04:22:38] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 04:22:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3958891283969258298.gal : 226 ms
[2023-03-20 04:22:38] [INFO ] Time to serialize properties into /tmp/CTLFireability6549748672248763514.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3958891283969258298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6549748672248763514.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7997,0.14942,7860,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: EF((EG(EX(((haveA2andB<1)&&(haveA2<1)))) + (!(A((haveA2<1) U AF(((resB>=1)&&(haveA>=1))))) * ((EX((((resA>=1)&&(Clients>=1))&&(haveA2>=1)...254
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),EX(((haveA2andB<1)&&(haveA2<1))))] != FALSE + (([(EY((FwdU(Init,TRUE) * !(!((E(!(!(EG(!((...808
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 4/0/2
(forward)formula 0,0,0.591419,21424,1,0,18,92720,47,3,302,86110,18
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 04:22:39] [INFO ] Invariant cache hit.
[2023-03-20 04:22:39] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-20 04:22:39] [INFO ] Invariant cache hit.
[2023-03-20 04:22:39] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-20 04:22:39] [INFO ] Invariant cache hit.
[2023-03-20 04:22:39] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 04:22:39] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:39] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:39] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 04:22:39] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:39] [INFO ] Flatten gal took : 0 ms
[2023-03-20 04:22:39] [INFO ] Time to serialize gal into /tmp/CTLFireability17521954970025192171.gal : 0 ms
[2023-03-20 04:22:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4147783848254667367.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17521954970025192171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4147783848254667367.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7997,0.124943,7868,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: (EF(AG((haveAandB<1))) * E(AF((((AX((haveA2>=1)) + (haveAandB>=1)) + AF((haveA2andB>=1))) * ((!((haveA2andB>=1)&&(haveA2>=1)))||(haveA2<1...191
=> equivalent forward existential formula: [(FwdU(FwdU((Init * E(TRUE U !(E(TRUE U !((haveAandB<1)))))),!(EG(!((((!(EX(!((haveA2>=1)))) + (haveAandB>=1)) +...280
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.611608,22656,1,0,17,103754,38,6,290,104392,13
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 4 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 04:22:40] [INFO ] Invariant cache hit.
[2023-03-20 04:22:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-20 04:22:40] [INFO ] Invariant cache hit.
[2023-03-20 04:22:40] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-20 04:22:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 04:22:40] [INFO ] Invariant cache hit.
[2023-03-20 04:22:40] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 04:22:40] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:40] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:40] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 04:22:40] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:40] [INFO ] Flatten gal took : 0 ms
[2023-03-20 04:22:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15717994074457201541.gal : 0 ms
[2023-03-20 04:22:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10564291330883022481.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15717994074457201541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10564291330883022481.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
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,7997,0.125501,7864,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: AF((AF(E(((resA>=1)&&(Clients>=1)) U (((haveA2>=1)||((resA>=1)&&(haveB>=1)))||((haveAandB>=1)&&(haveA2andB>=1))))) * (haveA2andB>=1)))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(E(((resA>=1)&&(Clients>=1)) U (((haveA2>=1)||((resA>=1)&&(haveB>=1)))||((haveAandB>=1)&&(ha...203
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 2/2/4
Using saturation style SCC detection
(forward)formula 0,1,0.320259,12352,1,0,135,44371,29,90,304,49124,97
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 04:22:40] [INFO ] Invariant cache hit.
[2023-03-20 04:22:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-20 04:22:40] [INFO ] Invariant cache hit.
[2023-03-20 04:22:40] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-20 04:22:40] [INFO ] Invariant cache hit.
[2023-03-20 04:22:40] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 04:22:40] [INFO ] Flatten gal took : 2 ms
[2023-03-20 04:22:40] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:40] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 04:22:40] [INFO ] Flatten gal took : 2 ms
[2023-03-20 04:22:40] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:40] [INFO ] Time to serialize gal into /tmp/CTLFireability15786814585816455066.gal : 1 ms
[2023-03-20 04:22:40] [INFO ] Time to serialize properties into /tmp/CTLFireability9494860780734805053.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15786814585816455066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9494860780734805053.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7997,0.127914,7868,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: AX((((haveAandB>=1) * (EG(((resB<1)||(haveA<1))) + ((resA>=1)&&(haveB>=1)))) + ((haveAandB<1) * EG((haveA2andB<1)))))
=> equivalent forward existential formula: ([((EY(Init) * !(((haveAandB<1) * EG((haveA2andB<1))))) * !((haveAandB>=1)))] = FALSE * [(((EY(Init) * !(((haveA...258
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.530542,19616,1,0,10,88699,28,3,277,77002,8
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 04:22:41] [INFO ] Invariant cache hit.
[2023-03-20 04:22:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 04:22:41] [INFO ] Invariant cache hit.
[2023-03-20 04:22:41] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-20 04:22:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 04:22:41] [INFO ] Invariant cache hit.
[2023-03-20 04:22:41] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 94 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 04:22:41] [INFO ] Flatten gal took : 3 ms
[2023-03-20 04:22:41] [INFO ] Flatten gal took : 2 ms
[2023-03-20 04:22:41] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 04:22:41] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:41] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1560036968199443876.gal : 1 ms
[2023-03-20 04:22:41] [INFO ] Time to serialize properties into /tmp/CTLFireability3396858603922717627.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1560036968199443876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3396858603922717627.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7997,0.129743,7860,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: EF((AG((((((((haveA2<1)||(resA<1))||((haveB<1)||(resA<1)))||(haveB<1)) * E((haveA2>=1) U (haveA2andB>=1))) * (((haveA2andB>=1)||(haveAand...209
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (haveA2andB>=1)) * !(E(TRUE U !((((((((haveA2<1)||(resA<1))||((haveB<1)||(resA<1)))||(haveB...273
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 4/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
(forward)formula 0,0,0.320698,11820,1,0,15,42546,24,4,286,45608,11
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 04:22:41] [INFO ] Invariant cache hit.
[2023-03-20 04:22:41] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-20 04:22:41] [INFO ] Invariant cache hit.
[2023-03-20 04:22:41] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-20 04:22:41] [INFO ] Invariant cache hit.
[2023-03-20 04:22:41] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 04:22:41] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:41] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:41] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 04:22:41] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:41] [INFO ] Flatten gal took : 0 ms
[2023-03-20 04:22:41] [INFO ] Time to serialize gal into /tmp/CTLFireability2345958736005537070.gal : 0 ms
[2023-03-20 04:22:41] [INFO ] Time to serialize properties into /tmp/CTLFireability17644262725350858170.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2345958736005537070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17644262725350858170.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7997,0.129172,7864,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: (AG(!(A((haveA2andB<1) U AG(((resA>=1)&&(haveB>=1)))))) + (EX((EG(((resA<1)||(haveB<1))) + (((resB>=1)&&(haveA>=1))&&((resA>=1)&&(haveB>=...276
=> equivalent forward existential formula: [((FwdU((Init * !((EX((EG(((resA<1)||(haveB<1))) + (((resB>=1)&&(haveA>=1))&&((resA>=1)&&(haveB>=1))))) * !(!((E...611
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.285697,11032,1,0,7,38855,17,1,267,40714,8
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 9 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-20 04:22:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-20 04:22:42] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-20 04:22:42] [INFO ] Invariant cache hit.
[2023-03-20 04:22:42] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-20 04:22:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-20 04:22:42] [INFO ] Invariant cache hit.
[2023-03-20 04:22:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 97 ms. Remains : 6/8 places, 4/6 transitions.
[2023-03-20 04:22:42] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:42] [INFO ] Flatten gal took : 0 ms
[2023-03-20 04:22:42] [INFO ] Input system was already deterministic with 4 transitions.
[2023-03-20 04:22:42] [INFO ] Flatten gal took : 0 ms
[2023-03-20 04:22:42] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:42] [INFO ] Time to serialize gal into /tmp/CTLFireability8217296229539793759.gal : 8 ms
[2023-03-20 04:22:42] [INFO ] Time to serialize properties into /tmp/CTLFireability16959337222589550192.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8217296229539793759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16959337222589550192.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,571,0.012433,3892,2,804,5,2215,6,0,31,1927,0


Converting to forward existential form...Done !
original formula: EF(EG(AF((haveA2andB<1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!((haveA2andB<1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.032133,4420,1,0,11,4779,23,4,207,4205,10
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-20 04:22:42] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-20 04:22:42] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-20 04:22:42] [INFO ] Invariant cache hit.
[2023-03-20 04:22:42] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-20 04:22:42] [INFO ] Invariant cache hit.
[2023-03-20 04:22:42] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 04:22:42] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:42] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:42] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 04:22:42] [INFO ] Flatten gal took : 0 ms
[2023-03-20 04:22:42] [INFO ] Flatten gal took : 0 ms
[2023-03-20 04:22:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3620848137961968157.gal : 0 ms
[2023-03-20 04:22:42] [INFO ] Time to serialize properties into /tmp/CTLFireability14017077667823082929.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3620848137961968157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14017077667823082929.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7997,0.129777,7864,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: EG(((!(A(AG(!(((resA>=1)&&(haveB>=1)))) U EG(E((haveA2>=1) U (haveA2andB>=1))))) + !(A(((haveA2andB>=1) * EF((haveA2>=1))) U ((haveA2>=1)...339
=> equivalent forward existential formula: [FwdG(Init,((!(!((E(!(EG(E((haveA2>=1) U (haveA2andB>=1)))) U (!(!(E(TRUE U !(!(((resA>=1)&&(haveB>=1))))))) * !...727
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 4/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Using saturation style SCC detection
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 1/4/5
(forward)formula 0,0,0.738512,24876,1,0,144,105073,54,95,336,116458,113
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 04:22:42] [INFO ] Invariant cache hit.
[2023-03-20 04:22:43] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-20 04:22:43] [INFO ] Invariant cache hit.
[2023-03-20 04:22:43] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-20 04:22:43] [INFO ] Invariant cache hit.
[2023-03-20 04:22:43] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 04:22:43] [INFO ] Flatten gal took : 2 ms
[2023-03-20 04:22:43] [INFO ] Flatten gal took : 2 ms
[2023-03-20 04:22:43] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 04:22:43] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:43] [INFO ] Flatten gal took : 0 ms
[2023-03-20 04:22:43] [INFO ] Time to serialize gal into /tmp/CTLFireability11788703712343974796.gal : 0 ms
[2023-03-20 04:22:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12692242366315342407.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11788703712343974796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12692242366315342407.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
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,7997,0.132005,7864,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: E((((haveA2andB>=1) + AG((EF(((resA>=1)&&(Clients>=1))) + EX((haveA2andB>=1))))) + EG((haveAandB<1))) U EG(EF(!(AX((haveAandB>=1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,(((haveA2andB>=1) + !(E(TRUE U !((E(TRUE U ((resA>=1)&&(Clients>=1))) + EX((haveA2andB>=1)))))))...226
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.452778,16576,1,0,10,63545,27,2,287,65777,18
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 04:22:43] [INFO ] Invariant cache hit.
[2023-03-20 04:22:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-20 04:22:43] [INFO ] Invariant cache hit.
[2023-03-20 04:22:43] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-20 04:22:43] [INFO ] Invariant cache hit.
[2023-03-20 04:22:43] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 04:22:43] [INFO ] Flatten gal took : 2 ms
[2023-03-20 04:22:43] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:43] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 04:22:43] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:43] [INFO ] Flatten gal took : 0 ms
[2023-03-20 04:22:43] [INFO ] Time to serialize gal into /tmp/CTLFireability4286374547939068295.gal : 1 ms
[2023-03-20 04:22:43] [INFO ] Time to serialize properties into /tmp/CTLFireability11087656123796005798.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4286374547939068295.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11087656123796005798.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7997,0.125655,7860,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: (AG(A(EG(AX(((resB>=1)&&(haveA>=1)))) U !(E(EX(((resA>=1)&&(Clients>=1))) U ((haveA2andB>=1)||(haveAandB>=1)))))) + EG((haveA2andB>=1)))
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU((Init * !(EG((haveA2andB>=1)))),TRUE),!(!(E(EX(((resA>=1)&&(Clients>=1))) U ((haveA2andB>=1)|...433
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.349018,13140,1,0,19,45475,28,10,277,50927,24
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 04:22:43] [INFO ] Invariant cache hit.
[2023-03-20 04:22:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-20 04:22:44] [INFO ] Invariant cache hit.
[2023-03-20 04:22:44] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-20 04:22:44] [INFO ] Invariant cache hit.
[2023-03-20 04:22:44] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 04:22:44] [INFO ] Flatten gal took : 2 ms
[2023-03-20 04:22:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:44] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 04:22:44] [INFO ] Flatten gal took : 0 ms
[2023-03-20 04:22:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8134369921759339341.gal : 1 ms
[2023-03-20 04:22:44] [INFO ] Time to serialize properties into /tmp/CTLFireability17316525145546398960.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8134369921759339341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17316525145546398960.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7997,0.129531,7868,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: EX(((resB>=1)&&(haveA>=1)))
=> equivalent forward existential formula: [(EY(Init) * ((resB>=1)&&(haveA>=1)))] != FALSE
(forward)formula 0,1,0.133471,8132,1,0,8,23925,8,1,77,26089,2
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-20 04:22:44] [INFO ] Invariant cache hit.
[2023-03-20 04:22:44] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-20 04:22:44] [INFO ] Invariant cache hit.
[2023-03-20 04:22:44] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-20 04:22:44] [INFO ] Invariant cache hit.
[2023-03-20 04:22:44] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 8/8 places, 6/6 transitions.
[2023-03-20 04:22:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:44] [INFO ] Flatten gal took : 1 ms
[2023-03-20 04:22:44] [INFO ] Input system was already deterministic with 6 transitions.
[2023-03-20 04:22:44] [INFO ] Flatten gal took : 0 ms
[2023-03-20 04:22:44] [INFO ] Flatten gal took : 0 ms
[2023-03-20 04:22:44] [INFO ] Time to serialize gal into /tmp/CTLFireability10002583652053778494.gal : 0 ms
[2023-03-20 04:22:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14375190836664627566.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10002583652053778494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14375190836664627566.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
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,7997,0.128116,7864,2,2410,5,23925,6,0,41,26089,0


Converting to forward existential form...Done !
original formula: EG(EF(((E((AG((haveA2>=1)) * !(((resA>=1)&&(haveB>=1)))) U ((resA>=1)&&(Clients>=1))) * EX((haveAandB<1))) * ((resA>=1)&&(haveB>=1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((E((!(E(TRUE U !((haveA2>=1)))) * !(((resA>=1)&&(haveB>=1)))) U ((resA>=1)&&(Clients>=1))) ...214
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.385709,13936,1,0,14,50189,26,4,289,54148,19
FORMULA TwoPhaseLocking-PT-nC00020vN-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2023-03-20 04:22:44] [INFO ] Flatten gal took : 2 ms
[2023-03-20 04:22:44] [INFO ] Flatten gal took : 1 ms
Total runtime 8371 ms.

BK_STOP 1679286166751

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="TwoPhaseLocking-PT-nC00020vN"
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-5348"
echo " Executing tool itstools"
echo " Input is TwoPhaseLocking-PT-nC00020vN, 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 r485-tall-167912699900810"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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