About the Execution of ITS-Tools for Philosophers-PT-000020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11419.960 | 657421.00 | 675014.00 | 1949.70 | TFTFFTTFTFFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016500298.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-PT-000020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016500298
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 25K Apr 29 11:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 29 11:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 29 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 29 11:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K May 9 08:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 9 08:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 9 08:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 9 08:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 9 08:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K May 9 08:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 44K May 10 09:34 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 Philosophers-PT-000020-CTLFireability-00
FORMULA_NAME Philosophers-PT-000020-CTLFireability-01
FORMULA_NAME Philosophers-PT-000020-CTLFireability-02
FORMULA_NAME Philosophers-PT-000020-CTLFireability-03
FORMULA_NAME Philosophers-PT-000020-CTLFireability-04
FORMULA_NAME Philosophers-PT-000020-CTLFireability-05
FORMULA_NAME Philosophers-PT-000020-CTLFireability-06
FORMULA_NAME Philosophers-PT-000020-CTLFireability-07
FORMULA_NAME Philosophers-PT-000020-CTLFireability-08
FORMULA_NAME Philosophers-PT-000020-CTLFireability-09
FORMULA_NAME Philosophers-PT-000020-CTLFireability-10
FORMULA_NAME Philosophers-PT-000020-CTLFireability-11
FORMULA_NAME Philosophers-PT-000020-CTLFireability-12
FORMULA_NAME Philosophers-PT-000020-CTLFireability-13
FORMULA_NAME Philosophers-PT-000020-CTLFireability-14
FORMULA_NAME Philosophers-PT-000020-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1652821996730
Running Version 202205111006
[2022-05-17 21:13:17] [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-17 21:13:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:13:18] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2022-05-17 21:13:18] [INFO ] Transformed 100 places.
[2022-05-17 21:13:18] [INFO ] Transformed 100 transitions.
[2022-05-17 21:13:18] [INFO ] Found NUPN structural information;
[2022-05-17 21:13:18] [INFO ] Parsed PT model containing 100 places and 100 transitions in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 15 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:18] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-17 21:13:18] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:18] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:13:18] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:18] [INFO ] Computed 40 place invariants in 6 ms
[2022-05-17 21:13:18] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
Support contains 100 out of 100 places after structural reductions.
[2022-05-17 21:13:18] [INFO ] Flatten gal took : 38 ms
[2022-05-17 21:13:18] [INFO ] Flatten gal took : 37 ms
[2022-05-17 21:13:19] [INFO ] Input system was already deterministic with 100 transitions.
Finished random walk after 1858 steps, including 1 resets, run visited all 74 properties in 73 ms. (steps per millisecond=25 )
[2022-05-17 21:13:19] [INFO ] Flatten gal took : 15 ms
[2022-05-17 21:13:19] [INFO ] Flatten gal took : 24 ms
[2022-05-17 21:13:19] [INFO ] Input system was already deterministic with 100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 10 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:19] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:13:19] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:19] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-17 21:13:19] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2022-05-17 21:13:19] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:19] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:13:19] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2022-05-17 21:13:19] [INFO ] Flatten gal took : 6 ms
[2022-05-17 21:13:19] [INFO ] Flatten gal took : 7 ms
[2022-05-17 21:13:19] [INFO ] Input system was already deterministic with 100 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
FORMULA Philosophers-PT-000020-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:19] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:13:19] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:19] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:13:20] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:20] [INFO ] Computed 40 place invariants in 4 ms
[2022-05-17 21:13:20] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2022-05-17 21:13:20] [INFO ] Flatten gal took : 7 ms
[2022-05-17 21:13:20] [INFO ] Flatten gal took : 8 ms
[2022-05-17 21:13:20] [INFO ] Input system was already deterministic with 100 transitions.
[2022-05-17 21:13:20] [INFO ] Flatten gal took : 10 ms
[2022-05-17 21:13:20] [INFO ] Flatten gal took : 7 ms
[2022-05-17 21:13:20] [INFO ] Time to serialize gal into /tmp/CTLFireability809539748309042300.gal : 8 ms
[2022-05-17 21:13:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2558661485108820456.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/CTLFireability809539748309042300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2558661485108820456.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.024939,5080,2,506,5,2179,6,0,503,1612,0
Converting to forward existential form...Done !
original formula: ((AX(AF(((((((Eat_17==0)&&(Eat_16==0))&&((Eat_15==0)&&(Eat_14==0)))&&(((Eat_3==0)&&(Eat_5==0))&&((Eat_2==0)&&(Eat_4==0))))&&((((Eat_1==0)...8139
=> equivalent forward existential formula: (([(((Init * !(!(EX(!(!(EG(!(((((((Eat_17==0)&&(Eat_16==0))&&((Eat_15==0)&&(Eat_14==0)))&&(((Eat_3==0)&&(Eat_5==...15269
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,2.45181,97344,1,0,78,426390,34,49,3066,741310,59
FORMULA Philosophers-PT-000020-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:22] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:13:22] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:22] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:13:22] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2022-05-17 21:13:22] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:22] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:13:22] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2022-05-17 21:13:22] [INFO ] Flatten gal took : 6 ms
[2022-05-17 21:13:22] [INFO ] Flatten gal took : 7 ms
[2022-05-17 21:13:22] [INFO ] Input system was already deterministic with 100 transitions.
[2022-05-17 21:13:23] [INFO ] Flatten gal took : 7 ms
[2022-05-17 21:13:23] [INFO ] Flatten gal took : 7 ms
[2022-05-17 21:13:23] [INFO ] Time to serialize gal into /tmp/CTLFireability2464390735214275958.gal : 2 ms
[2022-05-17 21:13:23] [INFO ] Time to serialize properties into /tmp/CTLFireability14126879502104155451.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/CTLFireability2464390735214275958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14126879502104155451.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.021128,5180,2,506,5,2179,6,0,503,1612,0
Converting to forward existential form...Done !
original formula: (E((((((((Think_6==1)&&(Fork_5==1))||((Think_9==1)&&(Fork_8==1)))||(((Think_16==1)&&(Fork_15==1))||((Think_4==1)&&(Fork_3==1))))||((((Thi...8847
=> equivalent forward existential formula: (([(FwdU((Init * E((((((((Think_6==1)&&(Fork_5==1))||((Think_9==1)&&(Fork_8==1)))||(((Think_16==1)&&(Fork_15==1)...20124
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/100
Hit Full ! (commute/partial/dont) 0/0/100
(forward)formula 0,1,0.367285,16916,1,0,15,62210,36,8,3055,49735,27
FORMULA Philosophers-PT-000020-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:23] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:13:23] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:23] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:13:23] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:23] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:13:23] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2022-05-17 21:13:23] [INFO ] Flatten gal took : 6 ms
[2022-05-17 21:13:23] [INFO ] Flatten gal took : 10 ms
[2022-05-17 21:13:23] [INFO ] Input system was already deterministic with 100 transitions.
[2022-05-17 21:13:23] [INFO ] Flatten gal took : 7 ms
[2022-05-17 21:13:23] [INFO ] Flatten gal took : 8 ms
[2022-05-17 21:13:23] [INFO ] Time to serialize gal into /tmp/CTLFireability16811121895210865675.gal : 1 ms
[2022-05-17 21:13:23] [INFO ] Time to serialize properties into /tmp/CTLFireability16000922146974419450.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/CTLFireability16811121895210865675.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16000922146974419450.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.020615,5172,2,506,5,2179,6,0,503,1612,0
Converting to forward existential form...Done !
original formula: (AX(AG((EX((((((((Fork_20==1)&&(Catch2_1==1))||((Fork_17==1)&&(Catch2_18==1)))||(((Fork_10==1)&&(Catch2_11==1))||((Fork_18==1)&&(Catch2_1...12351
=> equivalent forward existential formula: (([(FwdU(((EY((Init * !(!(EX(!(!(E(TRUE U !((EX((((((((Fork_20==1)&&(Catch2_1==1))||((Fork_17==1)&&(Catch2_18==1...45511
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/0/100
Hit Full ! (commute/partial/dont) 0/0/100
Hit Full ! (commute/partial/dont) 0/863/100
Hit Full ! (commute/partial/dont) 0/863/100
Hit Full ! (commute/partial/dont) 40/1140/60
Hit Full ! (commute/partial/dont) 40/1140/60
Hit Full ! (commute/partial/dont) 0/859/100
Hit Full ! (commute/partial/dont) 0/859/100
(forward)formula 0,0,26.6668,817440,1,0,34,3.89738e+06,63,28,3680,5.50544e+06,42
FORMULA Philosophers-PT-000020-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:50] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:13:50] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:50] [INFO ] Computed 40 place invariants in 5 ms
[2022-05-17 21:13:50] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:50] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:13:50] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2022-05-17 21:13:50] [INFO ] Flatten gal took : 5 ms
[2022-05-17 21:13:50] [INFO ] Flatten gal took : 5 ms
[2022-05-17 21:13:50] [INFO ] Input system was already deterministic with 100 transitions.
[2022-05-17 21:13:50] [INFO ] Flatten gal took : 6 ms
[2022-05-17 21:13:50] [INFO ] Flatten gal took : 5 ms
[2022-05-17 21:13:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17292107076595575004.gal : 3 ms
[2022-05-17 21:13:50] [INFO ] Time to serialize properties into /tmp/CTLFireability18373040587317257689.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/CTLFireability17292107076595575004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18373040587317257689.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.019415,5060,2,506,5,2179,6,0,503,1612,0
Converting to forward existential form...Done !
original formula: (AX((A(EX((((((((Eat_17==1)||(Eat_16==1))||((Eat_15==1)||(Eat_14==1)))||(((Eat_3==1)||(Eat_5==1))||((Eat_2==1)||(Eat_4==1))))||((((Eat_1=...4847
=> equivalent forward existential formula: (([((EY((EY(Init) * !(!((E(!(E(!(EG(!(((((((Eat_17==1)||(Eat_16==1))||((Eat_15==1)||(Eat_14==1)))||(((Eat_3==1)|...10813
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.118,10104,1,0,8,31462,21,3,2551,8761,9
FORMULA Philosophers-PT-000020-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:50] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:13:50] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:50] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-17 21:13:51] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:51] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-17 21:13:51] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2022-05-17 21:13:51] [INFO ] Flatten gal took : 5 ms
[2022-05-17 21:13:51] [INFO ] Flatten gal took : 6 ms
[2022-05-17 21:13:51] [INFO ] Input system was already deterministic with 100 transitions.
[2022-05-17 21:13:51] [INFO ] Flatten gal took : 6 ms
[2022-05-17 21:13:51] [INFO ] Flatten gal took : 5 ms
[2022-05-17 21:13:51] [INFO ] Time to serialize gal into /tmp/CTLFireability11390692752609911259.gal : 1 ms
[2022-05-17 21:13:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11813906225071003396.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/CTLFireability11390692752609911259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11813906225071003396.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.019332,5232,2,506,5,2179,6,0,503,1612,0
Converting to forward existential form...Done !
original formula: EX(((AG(EF((((((((Eat_17==0)&&(Eat_16==0))&&((Eat_15==0)&&(Eat_14==0)))&&(((Eat_3==0)&&(Eat_5==0))&&((Eat_2==0)&&(Eat_4==0))))&&((((Eat_1...3488
=> equivalent forward existential formula: (([(EY(Init) * !(E(TRUE U !(E(TRUE U (((((((Eat_17==0)&&(Eat_16==0))&&((Eat_15==0)&&(Eat_14==0)))&&(((Eat_3==0)&...4922
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.116868,9876,1,0,8,30132,14,2,2627,6809,6
FORMULA Philosophers-PT-000020-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 0 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:51] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:13:51] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:51] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:13:51] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:13:51] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:13:51] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2022-05-17 21:13:51] [INFO ] Flatten gal took : 6 ms
[2022-05-17 21:13:51] [INFO ] Flatten gal took : 8 ms
[2022-05-17 21:13:51] [INFO ] Input system was already deterministic with 100 transitions.
[2022-05-17 21:13:51] [INFO ] Flatten gal took : 9 ms
[2022-05-17 21:13:51] [INFO ] Flatten gal took : 7 ms
[2022-05-17 21:13:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16679148870131281463.gal : 0 ms
[2022-05-17 21:13:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12701472633838149112.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/CTLFireability16679148870131281463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12701472633838149112.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.02069,5252,2,506,5,2179,6,0,503,1612,0
Converting to forward existential form...Done !
original formula: E((((EG(!(((((((EF(((((((Eat_17==1)||(Eat_16==1))||((Eat_15==1)||(Eat_14==1)))||(((Eat_3==1)||(Eat_5==1))||((Eat_2==1)||(Eat_4==1))))||((...12373
=> equivalent forward existential formula: [(FwdU(Init,(((EG(!(((((((E(TRUE U ((((((Eat_17==1)||(Eat_16==1))||((Eat_15==1)||(Eat_14==1)))||(((Eat_3==1)||(E...12461
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/862/100
Hit Full ! (commute/partial/dont) 0/0/100
Detected timeout of ITS tools.
[2022-05-17 21:14:21] [INFO ] Flatten gal took : 13 ms
[2022-05-17 21:14:21] [INFO ] Applying decomposition
[2022-05-17 21:14:21] [INFO ] Flatten gal took : 8 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/graph5681976235295182826.txt' '-o' '/tmp/graph5681976235295182826.bin' '-w' '/tmp/graph5681976235295182826.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5681976235295182826.bin' '-l' '-1' '-v' '-w' '/tmp/graph5681976235295182826.weights' '-q' '0' '-e' '0.001'
[2022-05-17 21:14:21] [INFO ] Decomposing Gal with order
[2022-05-17 21:14:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 21:14:21] [INFO ] Removed a total of 20 redundant transitions.
[2022-05-17 21:14:21] [INFO ] Flatten gal took : 52 ms
[2022-05-17 21:14:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 6 ms.
[2022-05-17 21:14:21] [INFO ] Time to serialize gal into /tmp/CTLFireability14336914814856824947.gal : 2 ms
[2022-05-17 21:14:21] [INFO ] Time to serialize properties into /tmp/CTLFireability16498706130726955251.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/CTLFireability14336914814856824947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16498706130726955251.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,3.48678e+09,0.018803,5436,87,31,592,138,173,439,58,222,0
Converting to forward existential form...Done !
original formula: E((((EG(!(((((((EF(((((((i8.u19.Eat_17==1)||(i5.u18.Eat_16==1))||((i5.u10.Eat_15==1)||(i3.u8.Eat_14==1)))||(((i1.u4.Eat_3==1)||(i2.u5.Eat...17313
=> equivalent forward existential formula: [(FwdU(Init,(((EG(!(((((((E(TRUE U ((((((i8.u19.Eat_17==1)||(i5.u18.Eat_16==1))||((i5.u10.Eat_15==1)||(i3.u8.Eat...17401
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:51] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:14:51] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:51] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:14:51] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:51] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:14:51] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2022-05-17 21:14:52] [INFO ] Flatten gal took : 6 ms
[2022-05-17 21:14:52] [INFO ] Flatten gal took : 9 ms
[2022-05-17 21:14:52] [INFO ] Input system was already deterministic with 100 transitions.
[2022-05-17 21:14:52] [INFO ] Flatten gal took : 5 ms
[2022-05-17 21:14:52] [INFO ] Flatten gal took : 6 ms
[2022-05-17 21:14:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8884490841932681678.gal : 1 ms
[2022-05-17 21:14:52] [INFO ] Time to serialize properties into /tmp/CTLFireability8519474633806446907.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/CTLFireability8884490841932681678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8519474633806446907.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.01971,5168,2,506,5,2179,6,0,503,1612,0
Converting to forward existential form...Done !
original formula: AX(AF(E(((!(((((((Fork_20==1)&&(Catch1_20==1))||((Fork_12==1)&&(Catch1_12==1)))||(((Fork_17==1)&&(Catch1_17==1))||((Fork_4==1)&&(Catch1_4...2937
=> equivalent forward existential formula: [FwdG(EY(Init),!(E(((!(((((((Fork_20==1)&&(Catch1_20==1))||((Fork_12==1)&&(Catch1_12==1)))||(((Fork_17==1)&&(Cat...2982
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 0/180/100
(forward)formula 0,0,0.968111,37664,1,0,55,176977,24,44,2762,229652,51
FORMULA Philosophers-PT-000020-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:53] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:14:53] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:53] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:14:53] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:53] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:14:53] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2022-05-17 21:14:53] [INFO ] Flatten gal took : 4 ms
[2022-05-17 21:14:53] [INFO ] Flatten gal took : 4 ms
[2022-05-17 21:14:53] [INFO ] Input system was already deterministic with 100 transitions.
[2022-05-17 21:14:53] [INFO ] Flatten gal took : 4 ms
[2022-05-17 21:14:53] [INFO ] Flatten gal took : 4 ms
[2022-05-17 21:14:53] [INFO ] Time to serialize gal into /tmp/CTLFireability8811101884768146230.gal : 1 ms
[2022-05-17 21:14:53] [INFO ] Time to serialize properties into /tmp/CTLFireability3409421571569760824.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/CTLFireability8811101884768146230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3409421571569760824.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.019954,5308,2,506,5,2179,6,0,503,1612,0
Converting to forward existential form...Done !
original formula: A((Eat_14==1) U !(A((((Think_11==1)&&(Fork_11==1)) + !(AX(((Think_20==1)&&(Fork_20==1))))) U EF((EX(((Fork_17==1)&&(Catch2_18==1))) * AX(...171
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(E(TRUE U (EX(((Fork_17==1)&&(Catch2_18==1))) * !(EX(!((Eat_8==1))))))) U (!((((Think_1...1075
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.134013,10700,1,0,14,33735,29,9,2529,11883,16
FORMULA Philosophers-PT-000020-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 91 transition count 91
Applied a total of 18 rules in 18 ms. Remains 91 /100 variables (removed 9) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 91 cols
[2022-05-17 21:14:53] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:14:53] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 91 rows 91 cols
[2022-05-17 21:14:53] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:14:53] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2022-05-17 21:14:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 91 rows 91 cols
[2022-05-17 21:14:53] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:14:53] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 91/100 places, 91/100 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/100 places, 91/100 transitions.
[2022-05-17 21:14:53] [INFO ] Flatten gal took : 4 ms
[2022-05-17 21:14:53] [INFO ] Flatten gal took : 4 ms
[2022-05-17 21:14:53] [INFO ] Input system was already deterministic with 91 transitions.
[2022-05-17 21:14:53] [INFO ] Flatten gal took : 7 ms
[2022-05-17 21:14:53] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1853273875467931106.gal : 0 ms
[2022-05-17 21:14:53] [INFO ] Time to serialize properties into /tmp/CTLFireability10225347740053265716.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/CTLFireability1853273875467931106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10225347740053265716.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.08834e+09,0.018303,5028,2,415,5,1664,6,0,458,1165,0
Converting to forward existential form...Done !
original formula: AG(A((!((((Think_9==1)&&(Fork_9==1)) + A((Eat_16==1) U ((Fork_6==1)&&(Catch2_7==1))))) + EF((AF((Eat_17==1)) + AG(((Fork_4==1)&&(Catch1_4...235
=> equivalent forward existential formula: ([(((FwdU(FwdU(Init,TRUE),!((E(TRUE U ((Fork_19==1)&&(Catch1_19==1))) + ((Think_8==1)&&(Fork_7==1))))) * !((!(((...603
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.07884,8228,1,0,9,22113,21,4,2321,5694,12
FORMULA Philosophers-PT-000020-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 92 transition count 92
Applied a total of 16 rules in 7 ms. Remains 92 /100 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 92 cols
[2022-05-17 21:14:53] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:14:53] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 92 rows 92 cols
[2022-05-17 21:14:53] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:14:53] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2022-05-17 21:14:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 92 rows 92 cols
[2022-05-17 21:14:53] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:14:54] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 92/100 places, 92/100 transitions.
Finished structural reductions, in 1 iterations. Remains : 92/100 places, 92/100 transitions.
[2022-05-17 21:14:54] [INFO ] Flatten gal took : 4 ms
[2022-05-17 21:14:54] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:54] [INFO ] Input system was already deterministic with 92 transitions.
[2022-05-17 21:14:54] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:54] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:54] [INFO ] Time to serialize gal into /tmp/CTLFireability8846063303401423076.gal : 1 ms
[2022-05-17 21:14:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12705873733656270345.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/CTLFireability8846063303401423076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12705873733656270345.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.2933e+09,0.017596,5056,2,424,5,1696,6,0,463,1178,0
Converting to forward existential form...Done !
original formula: EF((AG((((((Think_8==0)||(Fork_7==0)) * ((!(E(((Think_18==1)&&(Fork_18==1)) U (Eat_19==1))) + (Think_3==0)) + (Fork_2==0))) * ((E((Eat_19...277
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (Eat_5==1)) * !(E(TRUE U !((((((Think_8==0)||(Fork_7==0)) * ((!(E(((Think_18==1)&&(Fork_18=...341
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 89/0/3
Hit Full ! (commute/partial/dont) 85/5/7
(forward)formula 0,0,0.101547,9312,1,0,26,28971,34,10,2245,13254,17
FORMULA Philosophers-PT-000020-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:54] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:14:54] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:54] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:14:54] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:54] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:14:54] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2022-05-17 21:14:54] [INFO ] Flatten gal took : 4 ms
[2022-05-17 21:14:54] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:54] [INFO ] Input system was already deterministic with 100 transitions.
[2022-05-17 21:14:54] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:54] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:54] [INFO ] Time to serialize gal into /tmp/CTLFireability6541132342882220537.gal : 1 ms
[2022-05-17 21:14:54] [INFO ] Time to serialize properties into /tmp/CTLFireability1507392161341333603.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/CTLFireability6541132342882220537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1507392161341333603.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.023406,5124,2,506,5,2179,6,0,503,1612,0
Converting to forward existential form...Done !
original formula: (EG((Eat_3==1)) + A((((Think_13==1)&&(Fork_12==1)) * (AF(!((((Fork_10==1)&&(Catch2_11==1))&&((Fork_3==1)&&(Catch1_3==1))))) * EF(EX(((Thi...361
=> equivalent forward existential formula: ([FwdG(Init,(Eat_3==1))] != FALSE + [((Init * !(EG(!(!(EX(!((((!(((Fork_9==1)&&(Catch1_9==1))) * E(TRUE U (Eat_1...1127
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 93/0/7
Hit Full ! (commute/partial/dont) 93/0/7
Hit Full ! (commute/partial/dont) 97/0/3
Using saturation style SCC detection
(forward)formula 0,1,0.466722,22968,1,0,45,105615,62,31,2897,94515,38
FORMULA Philosophers-PT-000020-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:54] [INFO ] Computed 40 place invariants in 3 ms
[2022-05-17 21:14:54] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:54] [INFO ] Computed 40 place invariants in 5 ms
[2022-05-17 21:14:55] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:55] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:14:55] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2022-05-17 21:14:55] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:55] [INFO ] Flatten gal took : 4 ms
[2022-05-17 21:14:55] [INFO ] Input system was already deterministic with 100 transitions.
[2022-05-17 21:14:55] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:55] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:55] [INFO ] Time to serialize gal into /tmp/CTLFireability17617313778876371451.gal : 2 ms
[2022-05-17 21:14:55] [INFO ] Time to serialize properties into /tmp/CTLFireability611484316773214888.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/CTLFireability17617313778876371451.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability611484316773214888.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.01966,5268,2,506,5,2179,6,0,503,1612,0
Converting to forward existential form...Done !
original formula: AX(EX(EG(((((Think_17==1)&&(Fork_17==1))||((Fork_15==1)&&(Catch1_15==1))) + (((Think_6==1)&&(Fork_6==1)) + (A(((Fork_5==1)&&(Catch2_6==1)...224
=> equivalent forward existential formula: [(EY(Init) * !(EX(EG(((((Think_17==1)&&(Fork_17==1))||((Fork_15==1)&&(Catch1_15==1))) + (((Think_6==1)&&(Fork_6=...356
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 93/0/7
Hit Full ! (commute/partial/dont) 93/0/7
Using saturation style SCC detection
(forward)formula 0,1,0.208213,14212,1,0,24,57439,32,12,2664,38023,17
FORMULA Philosophers-PT-000020-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:55] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:14:55] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:55] [INFO ] Computed 40 place invariants in 2 ms
[2022-05-17 21:14:55] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:55] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:14:55] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2022-05-17 21:14:55] [INFO ] Flatten gal took : 4 ms
[2022-05-17 21:14:55] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:55] [INFO ] Input system was already deterministic with 100 transitions.
[2022-05-17 21:14:55] [INFO ] Flatten gal took : 4 ms
[2022-05-17 21:14:55] [INFO ] Flatten gal took : 4 ms
[2022-05-17 21:14:55] [INFO ] Time to serialize gal into /tmp/CTLFireability3706497279201841823.gal : 1 ms
[2022-05-17 21:14:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4707350335271958304.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/CTLFireability3706497279201841823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4707350335271958304.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.019388,5088,2,506,5,2179,6,0,503,1612,0
Converting to forward existential form...Done !
original formula: AG(A(((!(((Think_10==1)&&(Fork_10==1))) * E(A(((Fork_2==1)&&(Catch2_3==1)) U ((Fork_6==1)&&(Catch2_7==1))) U !(((Think_1==1)&&(Fork_20==1...384
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(EX(E(TRUE U (((Eat_12==1)&&(Fork_19==1))&&(Catch1_19==1)))))) * !(((!(((Think_10==1)&...705
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.10643,9604,1,0,8,29937,20,3,2515,7189,12
FORMULA Philosophers-PT-000020-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:55] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:14:55] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:55] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:14:55] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 100 rows 100 cols
[2022-05-17 21:14:55] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:14:55] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 100/100 transitions.
[2022-05-17 21:14:55] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:55] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:55] [INFO ] Input system was already deterministic with 100 transitions.
[2022-05-17 21:14:55] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:55] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:55] [INFO ] Time to serialize gal into /tmp/CTLFireability17247063460027613361.gal : 1 ms
[2022-05-17 21:14:55] [INFO ] Time to serialize properties into /tmp/CTLFireability15961829770942664173.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/CTLFireability17247063460027613361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15961829770942664173.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.48678e+09,0.019363,5100,2,506,5,2179,6,0,503,1612,0
Converting to forward existential form...Done !
original formula: EX(AG((EF((((AX(((Think_18==1)&&(Fork_17==1))) * (Think_6==1)) * ((Fork_6==1)&&(Think_1==1))) * (Fork_20==1))) + ((Fork_15==1)&&(Catch2_1...164
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((E(TRUE U (((!(EX(!(((Think_18==1)&&(Fork_17==1))))) * (Think_6==1)) * ((Fork_6==1)&&(...233
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.089533,8828,1,0,15,27802,19,5,2344,4784,10
FORMULA Philosophers-PT-000020-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 86 transition count 86
Applied a total of 28 rules in 7 ms. Remains 86 /100 variables (removed 14) and now considering 86/100 (removed 14) transitions.
// Phase 1: matrix 86 rows 86 cols
[2022-05-17 21:14:56] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:14:56] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 86 rows 86 cols
[2022-05-17 21:14:56] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-17 21:14:56] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2022-05-17 21:14:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 86 rows 86 cols
[2022-05-17 21:14:56] [INFO ] Computed 40 place invariants in 0 ms
[2022-05-17 21:14:56] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 86/100 places, 86/100 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/100 places, 86/100 transitions.
[2022-05-17 21:14:56] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:56] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:56] [INFO ] Input system was already deterministic with 86 transitions.
[2022-05-17 21:14:56] [INFO ] Flatten gal took : 2 ms
[2022-05-17 21:14:56] [INFO ] Flatten gal took : 3 ms
[2022-05-17 21:14:56] [INFO ] Time to serialize gal into /tmp/CTLFireability8719909511762449732.gal : 1 ms
[2022-05-17 21:14:56] [INFO ] Time to serialize properties into /tmp/CTLFireability8186286865369218688.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/CTLFireability8719909511762449732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8186286865369218688.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,5.40841e+08,0.01649,5092,2,370,5,1525,6,0,433,1073,0
Converting to forward existential form...Done !
original formula: AG((AF(((Fork_6==0)||(Catch1_6==0))) + (EG(((Think_18==1)&&(Fork_17==1))) * EG(AG(((Fork_4==1)&&(Catch2_5==1)))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((EG(((Think_18==1)&&(Fork_17==1))) * EG(!(E(TRUE U !(((Fork_4==1)&&(Catch2_5==1))))))...200
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 79/6/7
(forward)formula 0,0,0.07217,7584,1,0,9,18701,32,3,2333,4822,11
FORMULA Philosophers-PT-000020-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2022-05-17 21:14:56] [INFO ] Flatten gal took : 6 ms
[2022-05-17 21:14:56] [INFO ] Flatten gal took : 7 ms
[2022-05-17 21:14:56] [INFO ] Applying decomposition
[2022-05-17 21:14:56] [INFO ] Flatten gal took : 5 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/graph17117937931705167483.txt' '-o' '/tmp/graph17117937931705167483.bin' '-w' '/tmp/graph17117937931705167483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17117937931705167483.bin' '-l' '-1' '-v' '-w' '/tmp/graph17117937931705167483.weights' '-q' '0' '-e' '0.001'
[2022-05-17 21:14:56] [INFO ] Decomposing Gal with order
[2022-05-17 21:14:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 21:14:56] [INFO ] Removed a total of 18 redundant transitions.
[2022-05-17 21:14:56] [INFO ] Flatten gal took : 11 ms
[2022-05-17 21:14:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 2 ms.
[2022-05-17 21:14:56] [INFO ] Time to serialize gal into /tmp/CTLFireability11607945294982561903.gal : 1 ms
[2022-05-17 21:14:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16806799400699942901.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/CTLFireability11607945294982561903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16806799400699942901.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,3.48678e+09,0.020501,5324,150,53,1115,260,205,795,85,408,0
Converting to forward existential form...Done !
original formula: E((((EG(!(((((((EF(((((((i5.u4.Eat_17==1)||(i3.u16.Eat_16==1))||((i3.u17.Eat_15==1)||(i2.u3.Eat_14==1)))||(((i0.u9.Eat_3==1)||(i7.u10.Eat...17254
=> equivalent forward existential formula: [(FwdU(Init,(((EG(!(((((((E(TRUE U ((((((i5.u4.Eat_17==1)||(i3.u16.Eat_16==1))||((i3.u17.Eat_15==1)||(i2.u3.Eat_...17342
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
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
(forward)formula 0,1,556.484,11148960,1,0,1.79845e+07,902,1720,2.26743e+07,332,3394,697295
FORMULA Philosophers-PT-000020-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Total runtime 656242 ms.
BK_STOP 1652822654151
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-000020"
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 Philosophers-PT-000020, 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 r168-tall-165277016500298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000020.tgz
mv Philosophers-PT-000020 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;