Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 10K Feb 26 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 12:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 12:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 87K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678826596760

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-03
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202303021504
[2023-03-14 20:43:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 20:43:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 20:43:18] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2023-03-14 20:43:18] [INFO ] Transformed 30 places.
[2023-03-14 20:43:18] [INFO ] Transformed 84 transitions.
[2023-03-14 20:43:18] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 109 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 6 formulas.
[2023-03-14 20:43:19] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-14 20:43:19] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-14 20:43:19] [INFO ] Reduced 5 identical enabling conditions.
[2023-03-14 20:43:19] [INFO ] Reduced 5 identical enabling conditions.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA PhilosophersDyn-PT-03-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 11 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-14 20:43:19] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2023-03-14 20:43:19] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-14 20:43:19] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
// Phase 1: matrix 51 rows 30 cols
[2023-03-14 20:43:19] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-14 20:43:19] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-14 20:43:19] [INFO ] Invariant cache hit.
[2023-03-14 20:43:19] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:43:19] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 364 ms. Remains : 30/30 places, 51/81 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-03-14 20:43:19] [INFO ] Flatten gal took : 33 ms
[2023-03-14 20:43:19] [INFO ] Flatten gal took : 16 ms
[2023-03-14 20:43:19] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 37) seen :26
Incomplete Best-First random walk after 10001 steps, including 236 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 235 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 237 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 231 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 288 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-14 20:43:20] [INFO ] Invariant cache hit.
[2023-03-14 20:43:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-14 20:43:21] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-14 20:43:21] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-14 20:43:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-14 20:43:21] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-14 20:43:21] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :4
[2023-03-14 20:43:21] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:43:21] [INFO ] After 21ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :7 sat :4
[2023-03-14 20:43:21] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :4
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-14 20:43:21] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :4
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 12 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:43:21] [INFO ] Invariant cache hit.
[2023-03-14 20:43:21] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 30/30 places, 51/51 transitions.
Incomplete random walk after 10000 steps, including 1434 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 625 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Probably explored full state space saw : 325 states, properties seen :0
Probabilistic random walk after 1090 steps, saw 325 distinct states, run finished after 15 ms. (steps per millisecond=72 ) properties seen :0
Explored full state space saw : 325 states, properties seen :0
Exhaustive walk after 1090 steps, saw 325 distinct states, run finished after 5 ms. (steps per millisecond=218 ) properties seen :0
Successfully simplified 11 atomic propositions for a total of 10 simplifications.
FORMULA PhilosophersDyn-PT-03-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 20:43:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-14 20:43:21] [INFO ] Flatten gal took : 9 ms
FORMULA PhilosophersDyn-PT-03-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 20:43:21] [INFO ] Flatten gal took : 9 ms
[2023-03-14 20:43:21] [INFO ] Input system was already deterministic with 51 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:43:21] [INFO ] Invariant cache hit.
[2023-03-14 20:43:21] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2023-03-14 20:43:21] [INFO ] Invariant cache hit.
[2023-03-14 20:43:21] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-14 20:43:21] [INFO ] Invariant cache hit.
[2023-03-14 20:43:21] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:43:21] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-14 20:43:21] [INFO ] Invariant cache hit.
[2023-03-14 20:43:21] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 30/30 places, 51/51 transitions.
[2023-03-14 20:43:21] [INFO ] Flatten gal took : 6 ms
[2023-03-14 20:43:21] [INFO ] Flatten gal took : 5 ms
[2023-03-14 20:43:21] [INFO ] Input system was already deterministic with 51 transitions.
[2023-03-14 20:43:22] [INFO ] Flatten gal took : 5 ms
[2023-03-14 20:43:22] [INFO ] Flatten gal took : 5 ms
[2023-03-14 20:43:22] [INFO ] Time to serialize gal into /tmp/CTLFireability13355998137048096504.gal : 1 ms
[2023-03-14 20:43:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9360680477403129557.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13355998137048096504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9360680477403129557.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AF(((((Forks_1>=1)&&(WaitLeft_1>=1))||((Forks_3>=1)&&(WaitLeft_3>=1)))||((WaitLeft_2>=1)&&(Forks_2>=1)))) * EX(EX(EX((A((((((((HasRight_...850
=> equivalent forward existential formula: ([FwdG(Init,!(((((Forks_1>=1)&&(WaitLeft_1>=1))||((Forks_3>=1)&&(WaitLeft_3>=1)))||((WaitLeft_2>=1)&&(Forks_2>=1...1034
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at eac...218
Hit Full ! (commute/partial/dont) 0/41/51
(forward)formula 0,0,0.188068,11596,1,0,135,33251,129,68,1950,24677,161
FORMULA PhilosophersDyn-PT-03-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:43:22] [INFO ] Invariant cache hit.
[2023-03-14 20:43:22] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-14 20:43:22] [INFO ] Invariant cache hit.
[2023-03-14 20:43:22] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-14 20:43:22] [INFO ] Invariant cache hit.
[2023-03-14 20:43:22] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:43:22] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-14 20:43:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 20:43:22] [INFO ] Invariant cache hit.
[2023-03-14 20:43:22] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 168 ms. Remains : 30/30 places, 51/51 transitions.
[2023-03-14 20:43:22] [INFO ] Flatten gal took : 10 ms
[2023-03-14 20:43:22] [INFO ] Flatten gal took : 5 ms
[2023-03-14 20:43:22] [INFO ] Input system was already deterministic with 51 transitions.
[2023-03-14 20:43:22] [INFO ] Flatten gal took : 4 ms
[2023-03-14 20:43:22] [INFO ] Flatten gal took : 4 ms
[2023-03-14 20:43:22] [INFO ] Time to serialize gal into /tmp/CTLFireability11332721242459529061.gal : 1 ms
[2023-03-14 20:43:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10932654737669245237.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11332721242459529061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10932654737669245237.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.024089,4288,2,498,5,2152,6,0,180,1731,0


Converting to forward existential form...Done !
original formula: EG((((((((Neighbourhood_2_2<1)||(WaitRight_2<1))||(Forks_2<1))&&(((WaitRight_1<1)||(Forks_3<1))||(Neighbourhood_1_3<1)))&&((((Forks_1<1)|...549
=> equivalent forward existential formula: [FwdG(Init,(((((((Neighbourhood_2_2<1)||(WaitRight_2<1))||(Forks_2<1))&&(((WaitRight_1<1)||(Forks_3<1))||(Neighb...592
Hit Full ! (commute/partial/dont) 0/34/51
(forward)formula 0,1,0.091437,7456,1,0,11,14640,19,3,1431,10836,9
FORMULA PhilosophersDyn-PT-03-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:43:22] [INFO ] Invariant cache hit.
[2023-03-14 20:43:22] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-14 20:43:22] [INFO ] Invariant cache hit.
[2023-03-14 20:43:22] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-14 20:43:22] [INFO ] Invariant cache hit.
[2023-03-14 20:43:22] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:43:22] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-14 20:43:22] [INFO ] Invariant cache hit.
[2023-03-14 20:43:22] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 30/30 places, 51/51 transitions.
[2023-03-14 20:43:22] [INFO ] Flatten gal took : 10 ms
[2023-03-14 20:43:23] [INFO ] Flatten gal took : 4 ms
[2023-03-14 20:43:23] [INFO ] Input system was already deterministic with 51 transitions.
[2023-03-14 20:43:23] [INFO ] Flatten gal took : 5 ms
[2023-03-14 20:43:23] [INFO ] Flatten gal took : 4 ms
[2023-03-14 20:43:23] [INFO ] Time to serialize gal into /tmp/CTLFireability10304745040913687370.gal : 0 ms
[2023-03-14 20:43:23] [INFO ] Time to serialize properties into /tmp/CTLFireability16675001137471032892.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10304745040913687370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16675001137471032892.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,325,0.019009,3972,2,498,5,2152,6,0,180,1731,0


Converting to forward existential form...Done !
original formula: EX((A(!((((((((Neighbourhood_2_2<1)||(WaitRight_2<1))||(Forks_2<1))&&(((WaitRight_1<1)||(Forks_3<1))||(Neighbourhood_1_3<1)))&&((((Forks_...1672
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!(!(EX(!(!(EG(!(!((((((((Neighbourhood_2_2<1)||(WaitRight_2<1))||(Forks_2<1))&&(((WaitRight_...2897
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at eac...218
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.270684,14552,1,0,212,47060,127,117,1939,40083,303
FORMULA PhilosophersDyn-PT-03-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:43:23] [INFO ] Invariant cache hit.
[2023-03-14 20:43:23] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-14 20:43:23] [INFO ] Invariant cache hit.
[2023-03-14 20:43:23] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-14 20:43:23] [INFO ] Invariant cache hit.
[2023-03-14 20:43:23] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:43:23] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-14 20:43:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 20:43:23] [INFO ] Invariant cache hit.
[2023-03-14 20:43:23] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 161 ms. Remains : 30/30 places, 51/51 transitions.
[2023-03-14 20:43:23] [INFO ] Flatten gal took : 8 ms
[2023-03-14 20:43:23] [INFO ] Flatten gal took : 6 ms
[2023-03-14 20:43:23] [INFO ] Input system was already deterministic with 51 transitions.
[2023-03-14 20:43:23] [INFO ] Flatten gal took : 5 ms
[2023-03-14 20:43:23] [INFO ] Flatten gal took : 6 ms
[2023-03-14 20:43:24] [INFO ] Time to serialize gal into /tmp/CTLFireability1204776312336369566.gal : 495 ms
[2023-03-14 20:43:24] [INFO ] Time to serialize properties into /tmp/CTLFireability10954404148735362661.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1204776312336369566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10954404148735362661.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EG(((E((((Outside_3>=1)&&(Outside_2>=1))&&(Outside_1>=1)) U (((((((HasRight_2>=1)&&(HasLeft_2>=1))&&(Neighbourhood_2_3>=1))||(((Neighbou...7393
=> equivalent forward existential formula: ([FwdG(Init,((E((((Outside_3>=1)&&(Outside_2>=1))&&(Outside_1>=1)) U (((((((HasRight_2>=1)&&(HasLeft_2>=1))&&(Ne...7460
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at eac...218
(forward)formula 0,1,0.150539,8504,1,0,104,15860,128,46,2139,13521,120
FORMULA PhilosophersDyn-PT-03-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:43:24] [INFO ] Invariant cache hit.
[2023-03-14 20:43:24] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-03-14 20:43:24] [INFO ] Invariant cache hit.
[2023-03-14 20:43:24] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-14 20:43:24] [INFO ] Invariant cache hit.
[2023-03-14 20:43:24] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:43:24] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-14 20:43:24] [INFO ] Invariant cache hit.
[2023-03-14 20:43:24] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 30/30 places, 51/51 transitions.
[2023-03-14 20:43:24] [INFO ] Flatten gal took : 4 ms
[2023-03-14 20:43:24] [INFO ] Flatten gal took : 5 ms
[2023-03-14 20:43:24] [INFO ] Input system was already deterministic with 51 transitions.
[2023-03-14 20:43:24] [INFO ] Flatten gal took : 4 ms
[2023-03-14 20:43:24] [INFO ] Flatten gal took : 4 ms
[2023-03-14 20:43:24] [INFO ] Time to serialize gal into /tmp/CTLFireability13593787592423345801.gal : 1 ms
[2023-03-14 20:43:24] [INFO ] Time to serialize properties into /tmp/CTLFireability9502228939023253397.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13593787592423345801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9502228939023253397.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(AG((A(AF(((((((((Forks_1>=1)&&(Think_1>=1))&&((Neighbourhood_1_1>=1)&&(Neighbourhood_2_1>=1)))||(((Think_3>=1)&&(Forks_3>=1))&&((Neigh...7635
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!((E(!(((((!((E(!(((((((((Outside_3>=1)&&(Forks_2>=1))&&((Forks_3>=1)&&(Neighbourhood...24408
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at eac...218
Using saturation style SCC detection
(forward)formula 0,0,0.667514,14856,1,0,200,42900,145,122,2110,39691,296
FORMULA PhilosophersDyn-PT-03-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-14 20:43:25] [INFO ] Invariant cache hit.
[2023-03-14 20:43:25] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-14 20:43:25] [INFO ] Invariant cache hit.
[2023-03-14 20:43:25] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-14 20:43:25] [INFO ] Invariant cache hit.
[2023-03-14 20:43:25] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 20:43:25] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-14 20:43:25] [INFO ] Invariant cache hit.
[2023-03-14 20:43:25] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 30/30 places, 51/51 transitions.
[2023-03-14 20:43:25] [INFO ] Flatten gal took : 3 ms
[2023-03-14 20:43:25] [INFO ] Flatten gal took : 4 ms
[2023-03-14 20:43:25] [INFO ] Input system was already deterministic with 51 transitions.
[2023-03-14 20:43:25] [INFO ] Flatten gal took : 4 ms
[2023-03-14 20:43:25] [INFO ] Flatten gal took : 3 ms
[2023-03-14 20:43:25] [INFO ] Time to serialize gal into /tmp/CTLFireability12087436536087237938.gal : 1 ms
[2023-03-14 20:43:25] [INFO ] Time to serialize properties into /tmp/CTLFireability173236123794074912.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12087436536087237938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability173236123794074912.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF((AX(FALSE) + (AG((((Forks_1>=1)&&(Think_1>=1))&&((Neighbourhood_2_1>=1)&&(Neighbourhood_1_3>=1)))) * ((EX((((Neighbourhood_1_2<1)||(Ha...303
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(FALSE))) + (!(E(TRUE U !((((Forks_1>=1)&&(Think_1>=1))&&((Neighbourhood_2_1>=1)&&(Neighbour...366
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t15, t17, t21, t32, t34, t35, t36, t44, t49, Intersection with reachable at eac...218
(forward)formula 0,0,0.105662,7984,1,0,119,16989,124,64,1881,16890,133
FORMULA PhilosophersDyn-PT-03-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2023-03-14 20:43:25] [INFO ] Flatten gal took : 9 ms
[2023-03-14 20:43:25] [INFO ] Flatten gal took : 11 ms
Total runtime 6468 ms.

BK_STOP 1678826630384

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-PT-03"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PhilosophersDyn-PT-03, 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 r293-tall-167873945200314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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