Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127200074.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NeighborGrid-PT-d2n3m1c12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127200074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 25 07:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 07:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 11K May 5 16:51 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 NeighborGrid-PT-d2n3m1c12-CTLFireability-00
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-01
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-02
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-03
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-04
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-05
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-06
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-07
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-08
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-09
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-10
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-11
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-12
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-13
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-14
FORMULA_NAME NeighborGrid-PT-d2n3m1c12-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620927224204

Running Version 0
[2021-05-13 17:33:45] [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]
[2021-05-13 17:33:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 17:33:45] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-13 17:33:45] [INFO ] Transformed 9 places.
[2021-05-13 17:33:45] [INFO ] Transformed 40 transitions.
[2021-05-13 17:33:45] [INFO ] Parsed PT model containing 9 places and 40 transitions in 59 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 6 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 4 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 5 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 3 identical enabling conditions.
[2021-05-13 17:33:45] [INFO ] Reduced 2 identical enabling conditions.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 40/40 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:33:45] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 17:33:45] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:33:45] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-13 17:33:45] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 9 cols
[2021-05-13 17:33:45] [INFO ] Computed 1 place invariants in 9 ms
[2021-05-13 17:33:46] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 40/40 transitions.
[2021-05-13 17:33:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 17:33:46] [INFO ] Flatten gal took : 27 ms
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 17:33:46] [INFO ] Flatten gal took : 6 ms
[2021-05-13 17:33:46] [INFO ] Input system was already deterministic with 40 transitions.
Finished random walk after 161 steps, including 0 resets, run visited all 71 properties in 5 ms. (steps per millisecond=32 )
Applied a total of 0 rules in 7 ms. Remains 9 /9 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2021-05-13 17:33:46] [INFO ] Flatten gal took : 3 ms
[2021-05-13 17:33:46] [INFO ] Flatten gal took : 2 ms
[2021-05-13 17:33:46] [INFO ] Input system was already deterministic with 40 transitions.
[2021-05-13 17:33:46] [INFO ] Flatten gal took : 3 ms
[2021-05-13 17:33:46] [INFO ] Flatten gal took : 2 ms
[2021-05-13 17:33:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9210070221880812460.gal : 1 ms
[2021-05-13 17:33:46] [INFO ] Time to serialize properties into /tmp/CTLFireability4751537898828353092.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability9210070221880812460.gal, -t, CGAL, -ctl, /tmp/CTLFireability4751537898828353092.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability9210070221880812460.gal -t CGAL -ctl /tmp/CTLFireability4751537898828353092.ctl --gen-order FOLLOW
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,24310,0.015183,4636,2,82,5,2022,6,0,79,1882,0


Converting to forward existential form...Done !
original formula: AF(EG((AG(((((((p_0_1>=1)||(p_1_0>=1))||(p_1_1>=1))||(p_2_0>=1))||(p_2_1>=1))||(p_2_2>=1))) + (((((p_0_0<1)&&(p_1_0<1))&&(p_1_1<1))&&(p_1_2<1))&&(p_2_1<1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(E(TRUE U !(((((((p_0_1>=1)||(p_1_0>=1))||(p_1_1>=1))||(p_2_0>=1))||(p_2_1>=1))||(p_2_2>=1))))) + (((((p_0_0<1)&&(p_1_0<1))&&(p_1_1<1))&&(p_1_2<1))&&(p_2_1<1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.176675,9508,1,0,31,28635,27,28,406,34998,39
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-13 17:33:46] [INFO ] Flatten gal took : 4 ms
[2021-05-13 17:33:46] [INFO ] Flatten gal took : 4 ms
[2021-05-13 17:33:46] [INFO ] Applying decomposition
[2021-05-13 17:33:46] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17282594895841364253.txt, -o, /tmp/graph17282594895841364253.bin, -w, /tmp/graph17282594895841364253.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17282594895841364253.bin, -l, -1, -v, -w, /tmp/graph17282594895841364253.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 17:33:46] [INFO ] Decomposing Gal with order
[2021-05-13 17:33:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 17:33:46] [INFO ] Removed a total of 30 redundant transitions.
[2021-05-13 17:33:46] [INFO ] Flatten gal took : 26 ms
[2021-05-13 17:33:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2021-05-13 17:33:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7676816936253867326.gal : 1 ms
[2021-05-13 17:33:46] [INFO ] Time to serialize properties into /tmp/CTLFireability15405831544717191892.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7676816936253867326.gal, -t, CGAL, -ctl, /tmp/CTLFireability15405831544717191892.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7676816936253867326.gal -t CGAL -ctl /tmp/CTLFireability15405831544717191892.ctl
No direction supplied, using forward translation only.
Parsed 13 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,24310,0.019284,5052,42,31,802,747,69,2479,23,3765,0


Converting to forward existential form...Done !
original formula: (AG((i0.u0.p_0_1>=1)) + AG(E(A((((((((i0.u1.p_0_0<1)&&(i0.u0.p_0_1<1))&&(u2.p_1_0<1))&&(i0.u1.p_1_1<1))&&(i0.u0.p_1_2<1))&&(i0.u1.p_2_2<1))||(((((i0.u1.p_1_1<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_0<1))&&(u2.p_2_1<1))&&(i0.u1.p_2_2<1))) U EX(((i0.u1.p_1_1>=1)||(i0.u1.p_2_2>=1)))) U ((((((((i0.u1.p_0_0<1)&&(i0.u0.p_0_1<1))&&(i0.u0.p_0_2<1))&&(u2.p_1_0<1))&&(i0.u0.p_1_2<1))&&(u2.p_2_0<1))&&(u2.p_2_1<1)) * EF((((((i0.u0.p_0_1>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(i0.u1.p_2_2>=1)))))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !((i0.u0.p_0_1>=1)))))),TRUE) * !(E(!((E(!(EX(((i0.u1.p_1_1>=1)||(i0.u1.p_2_2>=1)))) U (!((((((((i0.u1.p_0_0<1)&&(i0.u0.p_0_1<1))&&(u2.p_1_0<1))&&(i0.u1.p_1_1<1))&&(i0.u0.p_1_2<1))&&(i0.u1.p_2_2<1))||(((((i0.u1.p_1_1<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_0<1))&&(u2.p_2_1<1))&&(i0.u1.p_2_2<1)))) * !(EX(((i0.u1.p_1_1>=1)||(i0.u1.p_2_2>=1)))))) + EG(!(EX(((i0.u1.p_1_1>=1)||(i0.u1.p_2_2>=1))))))) U ((((((((i0.u1.p_0_0<1)&&(i0.u0.p_0_1<1))&&(i0.u0.p_0_2<1))&&(u2.p_1_0<1))&&(i0.u0.p_1_2<1))&&(u2.p_2_0<1))&&(u2.p_2_1<1)) * E(TRUE U (((((i0.u0.p_0_1>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(i0.u1.p_2_2>=1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
(forward)formula 0,1,0.049419,6228,1,0,1681,1482,407,4194,134,6770,2153
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((E(EF((((((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))) U !(EF(EX(((((i0.u1.p_0_0>=1)||(i0.u1.p_1_1>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1)))))) + (AX(A(((((i0.u0.p_0_1<1)&&(i0.u0.p_0_2<1))&&(u2.p_1_0<1))&&(i0.u0.p_1_2<1)) U ((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))&&(((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))))) * AX((((EG((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))) * (((((((i0.u0.p_0_2>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))) * (i0.u0.p_0_1>=1)) * ((((i0.u0.p_0_1>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(E(TRUE U (((((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))) U !(E(TRUE U EX(((((i0.u1.p_0_0>=1)||(i0.u1.p_1_1>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1)))))) + (!(EX(!(!((E(!(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))&&(((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1)))) U (!(((((i0.u0.p_0_1<1)&&(i0.u0.p_0_2<1))&&(u2.p_1_0<1))&&(i0.u0.p_1_2<1))) * !(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))&&(((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1)))))) + EG(!(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))&&(((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1)))))))))) * !(EX(!((((EG((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))) * (((((((i0.u0.p_0_2>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))) * (i0.u0.p_0_1>=1)) * ((((i0.u0.p_0_1>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1))))))))))] = FALSE
(forward)formula 1,0,1.50664,53484,1,0,44428,28192,480,259544,136,292372,21478
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(!(AX(E((((((u2.p_1_0>=1)||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))&&((i0.u1.p_0_0>=1)||(i0.u0.p_1_2>=1))) * EF(((((i0.u0.p_0_2>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1)))) U ((((AF((i0.u0.p_1_2>=1)) * (i0.u0.p_0_1<1)) * (i0.u0.p_0_2<1)) * (u2.p_1_0<1)) * (u2.p_2_1<1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E((((((u2.p_1_0>=1)||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))&&((i0.u1.p_0_0>=1)||(i0.u0.p_1_2>=1))) * E(TRUE U ((((i0.u0.p_0_2>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1)))) U ((((!(EG(!((i0.u0.p_1_2>=1)))) * (i0.u0.p_0_1<1)) * (i0.u0.p_0_2<1)) * (u2.p_1_0<1)) * (u2.p_2_1<1)))))))] = FALSE
(forward)formula 2,0,1.78276,61668,1,0,53930,32887,502,296477,136,334459,27509
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(EX(AG((AG((u2.p_2_1>=1)) * (((A(((((((i0.u0.p_0_2>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1)) U (u2.p_1_0>=1)) + (i0.u1.p_0_0>=1)) + (i0.u0.p_1_2>=1)) + (u2.p_2_1>=1))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U !((!(E(TRUE U !((u2.p_2_1>=1)))) * (((!((E(!((u2.p_1_0>=1)) U (!(((((((i0.u0.p_0_2>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))) * !((u2.p_1_0>=1)))) + EG(!((u2.p_1_0>=1))))) + (i0.u1.p_0_0>=1)) + (i0.u0.p_1_2>=1)) + (u2.p_2_1>=1)))))))] != FALSE
(forward)formula 3,0,1.79195,62196,1,0,54159,33156,518,296903,136,334944,27920
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(((EF((i0.u1.p_1_1>=1)) * (((((AG(A((((((i0.u1.p_0_0>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1)) U (((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1)))) + AX(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u0.p_0_2>=1))||(i0.u0.p_1_2>=1)))) + (i0.u0.p_0_1>=1)) + (i0.u0.p_0_2>=1)) + (u2.p_1_0>=1)) + (i0.u1.p_1_1>=1))) * (EF(((((((i0.u0.p_0_2<1)&&(u2.p_1_0<1))&&(i0.u1.p_1_1<1))&&(i0.u0.p_1_2<1))&&(u2.p_2_0<1))&&(i0.u1.p_2_2<1))) + EX(AX((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1)))))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U (i0.u1.p_1_1>=1))))] = FALSE * [(EY((((((FwdU(Init,TRUE) * !((i0.u1.p_1_1>=1))) * !((u2.p_1_0>=1))) * !((i0.u0.p_0_2>=1))) * !((i0.u0.p_0_1>=1))) * !(!(E(TRUE U !(!((E(!((((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))) U (!((((((i0.u1.p_0_0>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))) * !((((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))))) + EG(!((((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1)))))))))))) * !(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u0.p_0_2>=1))||(i0.u0.p_1_2>=1))))] = FALSE) * [((FwdU(Init,TRUE) * !(EX(!(EX(!((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1)))))))) * !(E(TRUE U ((((((i0.u0.p_0_2<1)&&(u2.p_1_0<1))&&(i0.u1.p_1_1<1))&&(i0.u0.p_1_2<1))&&(u2.p_2_0<1))&&(i0.u1.p_2_2<1)))))] = FALSE)
(forward)formula 4,0,1.82391,62988,1,0,55515,33487,556,301424,136,338842,30681
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((AG(EX(((i0.u1.p_0_0>=1)||(u2.p_2_1>=1)))) * (((((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(EX(((i0.u1.p_0_0>=1)||(u2.p_2_1>=1)))))) * (((((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1)))))] = FALSE
(forward)formula 5,0,1.83799,63516,1,0,55929,33653,618,302571,140,340153,32126
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((!(E(AX(((((i0.u1.p_1_1>=1)||(i0.u0.p_1_2>=1))||(i0.u0.p_0_1>=1))||(i0.u0.p_1_2>=1))) U !(A(((((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1)) U (((((i0.u1.p_0_0>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1)))))) + !(E((((((((i0.u1.p_0_0<1)&&(i0.u0.p_0_1<1))&&(u2.p_1_0<1))&&(i0.u1.p_1_1<1))&&(u2.p_2_1<1))||(((((i0.u0.p_0_1<1)&&(u2.p_1_0<1))&&(i0.u1.p_1_1<1))&&(u2.p_2_1<1))&&(i0.u1.p_2_2<1))) + !(E(((((i0.u1.p_0_0>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1)) U ((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))))) U ((((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1)) + (EG(((((u2.p_1_0>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))) * ((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(!(EX(!(((((i0.u1.p_1_1>=1)||(i0.u0.p_1_2>=1))||(i0.u0.p_0_1>=1))||(i0.u0.p_1_2>=1))))) U !(!((E(!((((((i0.u1.p_0_0>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1))) U (!(((((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))) * !((((((i0.u1.p_0_0>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1))))) + EG(!((((((i0.u1.p_0_0>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1))))))))) + !(E((((((((i0.u1.p_0_0<1)&&(i0.u0.p_0_1<1))&&(u2.p_1_0<1))&&(i0.u1.p_1_1<1))&&(u2.p_2_1<1))||(((((i0.u0.p_0_1<1)&&(u2.p_1_0<1))&&(i0.u1.p_1_1<1))&&(u2.p_2_1<1))&&(i0.u1.p_2_2<1))) + !(E(((((i0.u1.p_0_0>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1)) U ((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))))) U ((((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1)) + (EG(((((u2.p_1_0>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))) * ((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1)))))))))] = FALSE
(forward)formula 6,0,3.61555,108132,1,0,100053,58416,701,527767,141,578788,49932
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (A(((i0.u0.p_0_1>=1)||(i0.u1.p_2_2>=1)) U AX(((EX(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(i0.u1.p_2_2>=1))) * (((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))) + EG((((i0.u0.p_0_1<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1)))))) * !(AG(A(EG((((i0.u0.p_0_2<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1))) U AG(A(((((u2.p_1_0>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1)) U ((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))))))))
=> equivalent forward existential formula: (([(FwdU(FwdU((FwdU(FwdU((Init * !((E(!(!(EX(!(((EX(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(i0.u1.p_2_2>=1))) * (((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))) + EG((((i0.u0.p_0_1<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1)))))))) U (!(((i0.u0.p_0_1>=1)||(i0.u1.p_2_2>=1))) * !(!(EX(!(((EX(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(i0.u1.p_2_2>=1))) * (((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))) + EG((((i0.u0.p_0_1<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1)))))))))) + EG(!(!(EX(!(((EX(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(i0.u1.p_2_2>=1))) * (((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))) + EG((((i0.u0.p_0_1<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1)))))))))))),TRUE),!(!(E(TRUE U !(!((E(!(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))) U (!(((((u2.p_1_0>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1))) * !(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))))) + EG(!(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))))))))))) * !(EG((((i0.u0.p_0_2<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1))))),TRUE),!(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1)))) * (!(((((u2.p_1_0>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1))) * !(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1)))))] != FALSE + [FwdG(FwdU((FwdU(FwdU((Init * !((E(!(!(EX(!(((EX(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(i0.u1.p_2_2>=1))) * (((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))) + EG((((i0.u0.p_0_1<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1)))))))) U (!(((i0.u0.p_0_1>=1)||(i0.u1.p_2_2>=1))) * !(!(EX(!(((EX(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(i0.u1.p_2_2>=1))) * (((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))) + EG((((i0.u0.p_0_1<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1)))))))))) + EG(!(!(EX(!(((EX(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(i0.u1.p_2_2>=1))) * (((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))) + EG((((i0.u0.p_0_1<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1)))))))))))),TRUE),!(!(E(TRUE U !(!((E(!(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))) U (!(((((u2.p_1_0>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1))) * !(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))))) + EG(!(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))))))))))) * !(EG((((i0.u0.p_0_2<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1))))),TRUE),!(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))))] != FALSE) + [FwdG(FwdU((Init * !((E(!(!(EX(!(((EX(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(i0.u1.p_2_2>=1))) * (((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))) + EG((((i0.u0.p_0_1<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1)))))))) U (!(((i0.u0.p_0_1>=1)||(i0.u1.p_2_2>=1))) * !(!(EX(!(((EX(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(i0.u1.p_2_2>=1))) * (((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))) + EG((((i0.u0.p_0_1<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1)))))))))) + EG(!(!(EX(!(((EX(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(i0.u1.p_2_2>=1))) * (((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))) + EG((((i0.u0.p_0_1<1)&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1)))))))))))),TRUE),!(!(E(TRUE U !(!((E(!(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))) U (!(((((u2.p_1_0>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1))) * !(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))))) + EG(!(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1)))))))))))] != FALSE)
Fast SCC detection found an SCC at level 1
(forward)formula 7,1,3.97643,117900,1,0,111119,61322,760,571408,141,618462,60090
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((AF(((((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))) * ((!(AG((((i0.u1.p_1_1>=1)||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1)))) + ((((((i0.u1.p_0_0<1)&&(u2.p_1_0<1))&&(i0.u1.p_1_1<1))&&(i0.u0.p_1_2<1))&&(u2.p_2_0<1))&&(i0.u1.p_2_2<1))) + (((((!(AX(((((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1)))) * (i0.u1.p_0_0<1)) * (i0.u0.p_0_1<1)) * (i0.u1.p_1_1<1)) * (u2.p_2_1<1)) * (i0.u1.p_2_2<1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(((((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))))) * ((!(!(E(TRUE U !((((i0.u1.p_1_1>=1)||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1)))))) + ((((((i0.u1.p_0_0<1)&&(u2.p_1_0<1))&&(i0.u1.p_1_1<1))&&(i0.u0.p_1_2<1))&&(u2.p_2_0<1))&&(i0.u1.p_2_2<1))) + (((((!(!(EX(!(((((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1)))))) * (i0.u1.p_0_0<1)) * (i0.u0.p_0_1<1)) * (i0.u1.p_1_1<1)) * (u2.p_2_1<1)) * (i0.u1.p_2_2<1)))))] != FALSE
(forward)formula 8,1,4.60667,131648,1,0,127005,69437,793,624242,141,673437,67546
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(((((((i0.u0.p_0_2>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1)) + (E(((((EF(((((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))) * (i0.u0.p_0_2<1)) * (u2.p_1_0<1)) * (i0.u0.p_1_2<1)) * (u2.p_2_1<1)) U AF((((((((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(i0.u1.p_2_2>=1))||(i0.u0.p_0_1>=1))||(i0.u0.p_0_2>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1)))) * (!(AF(E(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1)) U (((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))))) + ((((((((i0.u0.p_0_1<1)&&(u2.p_1_0<1))&&(i0.u1.p_1_1<1))&&(i0.u0.p_1_2<1))&&(u2.p_2_0<1)) * AX(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u1.p_2_2>=1)))) * (i0.u1.p_0_0>=1)) * (EG(((((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))) + ((u2.p_2_1<1)&&(i0.u1.p_2_2<1))))))) U AG((((i0.u0.p_1_2>=1)||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((((i0.u0.p_1_2>=1)||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))))))))) * !(E(!(!(E(TRUE U !((((i0.u0.p_1_2>=1)||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1)))))) U (!(((((((i0.u0.p_0_2>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1)) + (E(((((E(TRUE U ((((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))) * (i0.u0.p_0_2<1)) * (u2.p_1_0<1)) * (i0.u0.p_1_2<1)) * (u2.p_2_1<1)) U !(EG(!((((((((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_0>=1))||(i0.u1.p_2_2>=1))||(i0.u0.p_0_1>=1))||(i0.u0.p_0_2>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1)))))) * (!(!(EG(!(E(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(i0.u1.p_2_2>=1)) U (((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))))))) + ((((((((i0.u0.p_0_1<1)&&(u2.p_1_0<1))&&(i0.u1.p_1_1<1))&&(i0.u0.p_1_2<1))&&(u2.p_2_0<1)) * !(EX(!(((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u1.p_2_2>=1)))))) * (i0.u1.p_0_0>=1)) * (EG(((((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))) + ((u2.p_2_1<1)&&(i0.u1.p_2_2<1)))))))) * !(!(E(TRUE U !((((i0.u0.p_1_2>=1)||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))))))))))] != FALSE
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
(forward)formula 9,0,4.6314,132440,1,0,127748,69569,847,625773,145,674309,68854
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(((((((AG((!(AX(((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_1>=1)))) * !(A((i0.u1.p_1_1>=1) U ((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1)))))) * !(A(!(EX((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_1>=1)))) U ((i0.u0.p_0_2>=1)||(i0.u1.p_1_1>=1))))) * (i0.u1.p_0_0<1)) * (i0.u0.p_0_1<1)) * (u2.p_1_0<1)) * (i0.u1.p_1_1<1)) * (u2.p_2_1<1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((((!(E(TRUE U !((!(!(EX(!(((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_1>=1)))))) * !(!((E(!(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))) U (!((i0.u1.p_1_1>=1)) * !(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))))) + EG(!(((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))))))))))) * !(!((E(!(((i0.u0.p_0_2>=1)||(i0.u1.p_1_1>=1))) U (!(!(EX((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_1>=1))))) * !(((i0.u0.p_0_2>=1)||(i0.u1.p_1_1>=1))))) + EG(!(((i0.u0.p_0_2>=1)||(i0.u1.p_1_1>=1)))))))) * (i0.u1.p_0_0<1)) * (i0.u0.p_0_1<1)) * (u2.p_1_0<1)) * (i0.u1.p_1_1<1)) * (u2.p_2_1<1))))] = FALSE
(forward)formula 10,0,4.65409,132968,1,0,128735,69801,870,627283,145,675360,70183
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX((((EF((i0.u1.p_1_1>=1)) * E(E(((i0.u1.p_1_1>=1)||(u2.p_2_1>=1)) U (((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))) U ((((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1)))) * EF(((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))&&(((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))))) * ((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_1>=1))))
=> equivalent forward existential formula: [(FwdU(((EY(Init) * ((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u1.p_1_1>=1))||(u2.p_2_1>=1))) * (E(TRUE U (i0.u1.p_1_1>=1)) * E(E(((i0.u1.p_1_1>=1)||(u2.p_2_1>=1)) U (((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))) U ((((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))))),TRUE) * ((((i0.u0.p_0_1>=1)||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))&&(((((i0.u0.p_0_1>=1)||(i0.u0.p_0_2>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))))] != FALSE
(forward)formula 11,1,4.66772,133232,1,0,129174,69901,889,628091,145,675889,71061
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(E(AX(EX((((((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))&&((((i0.u1.p_0_0>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1))))) U !(EX((E((i0.u1.p_1_1>=1) U ((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))) + AG((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u0.p_1_2>=1)))))))) + EX(E(AF((((((((i0.u0.p_0_1<1)&&(i0.u0.p_0_2<1))&&(i0.u1.p_1_1<1))&&(i0.u0.p_1_2<1))&&(u2.p_2_0<1))&&(u2.p_2_1<1))&&(i0.u1.p_2_2<1))) U (((((i0.u0.p_0_1<1)&&(u2.p_1_0<1))&&(i0.u1.p_1_1<1))&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(EX(E(!(EG(!((((((((i0.u0.p_0_1<1)&&(i0.u0.p_0_2<1))&&(i0.u1.p_1_1<1))&&(i0.u0.p_1_2<1))&&(u2.p_2_0<1))&&(u2.p_2_1<1))&&(i0.u1.p_2_2<1))))) U (((((i0.u0.p_0_1<1)&&(u2.p_1_0<1))&&(i0.u1.p_1_1<1))&&(i0.u0.p_1_2<1))&&(u2.p_2_1<1)))))),!(EX(!(EX((((((((((i0.u1.p_0_0>=1)||(i0.u0.p_0_2>=1))||(u2.p_1_0>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_0>=1))||(u2.p_2_1>=1))||(i0.u1.p_2_2>=1))&&((((i0.u1.p_0_0>=1)||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))||(u2.p_2_1>=1)))))))) * !(EX((E((i0.u1.p_1_1>=1) U ((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u1.p_1_1>=1))||(i0.u0.p_1_2>=1))) + !(E(TRUE U !((((i0.u1.p_0_0>=1)||(i0.u0.p_0_1>=1))||(i0.u0.p_1_2>=1)))))))))] = FALSE
(forward)formula 12,1,4.6806,133496,1,0,129577,70123,901,629296,145,677160,71230
FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1620927232427

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="NeighborGrid-PT-d2n3m1c12"
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 NeighborGrid-PT-d2n3m1c12, 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 r140-tall-162089127200074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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