fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r193-csrt-159033389200716
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for ResAllocation-PT-R015C002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.690 5504.00 11334.00 34.20 FFFFTFTFFFTTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033389200716.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R015C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389200716
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.4K May 14 00:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 00:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 13 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 64K May 12 20:53 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 ResAllocation-PT-R015C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590556231667

[2020-05-27 05:10:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 05:10:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 05:10:33] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2020-05-27 05:10:33] [INFO ] Transformed 60 places.
[2020-05-27 05:10:33] [INFO ] Transformed 32 transitions.
[2020-05-27 05:10:33] [INFO ] Parsed PT model containing 60 places and 32 transitions in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Incomplete random walk after 100000 steps, including 1461 resets, run finished after 230 ms. (steps per millisecond=434 ) properties seen :[1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 32 rows 60 cols
[2020-05-27 05:10:34] [INFO ] Computed 30 place invariants in 4 ms
[2020-05-27 05:10:34] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned unsat
[2020-05-27 05:10:34] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-05-27 05:10:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:34] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-05-27 05:10:34] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-05-27 05:10:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2020-05-27 05:10:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:34] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2020-05-27 05:10:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:34] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2020-05-27 05:10:34] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-05-27 05:10:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2020-05-27 05:10:34] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 4 ms.
[2020-05-27 05:10:34] [INFO ] Added : 24 causal constraints over 5 iterations in 99 ms. Result :sat
[2020-05-27 05:10:34] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2020-05-27 05:10:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:34] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-05-27 05:10:34] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints in 3 ms.
[2020-05-27 05:10:34] [INFO ] Added : 14 causal constraints over 3 iterations in 32 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-27 05:10:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-27 05:10:35] [INFO ] Flatten gal took : 40 ms
[2020-05-27 05:10:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-27 05:10:35] [INFO ] Flatten gal took : 19 ms
FORMULA ResAllocation-PT-R015C002-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 05:10:35] [INFO ] Applying decomposition
[2020-05-27 05:10:35] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph2638553367658677456.txt, -o, /tmp/graph2638553367658677456.bin, -w, /tmp/graph2638553367658677456.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph2638553367658677456.bin, -l, -1, -v, -w, /tmp/graph2638553367658677456.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 05:10:35] [INFO ] Decomposing Gal with order
[2020-05-27 05:10:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 05:10:35] [INFO ] Flatten gal took : 33 ms
[2020-05-27 05:10:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-27 05:10:35] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 4 ms
[2020-05-27 05:10:35] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
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,278528,0.029794,5172,81,7,1489,28,127,2480,13,32,0


Converting to forward existential form...Done !
original formula: EF(EX((((((i0.i1.u5.p_0_5>=1)&&(i0.i1.u6.r_0_6>=1))&&(i0.i1.u6.p_0_6>=1))&&(i1.u7.r_0_7>=1))||(((((i2.u11.p_0_11>=1)&&(i4.i0.u12.r_0_12>=1))&&(i0.i0.u3.r_0_3>=1))&&(i0.i0.u18.r_1_3>=1))&&(i0.i0.u19.p_1_4>=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (((((i0.i1.u5.p_0_5>=1)&&(i0.i1.u6.r_0_6>=1))&&(i0.i1.u6.p_0_6>=1))&&(i1.u7.r_0_7>=1))||(((((i2.u11.p_0_11>=1)&&(i4.i0.u12.r_0_12>=1))&&(i0.i0.u3.r_0_3>=1))&&(i0.i0.u18.r_1_3>=1))&&(i0.i0.u19.p_1_4>=1))))] != FALSE
(forward)formula 0,0,0.0309,5556,1,0,1489,28,190,2480,18,32,81
FORMULA ResAllocation-PT-R015C002-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF(EG((((i2.u11.r_0_11>=1)&&(i2.u26.r_1_11>=1))&&(i4.i0.u27.p_1_12>=1)))) + EG(((((i2.u11.r_0_11<1)||(i2.u26.r_1_11<1))||(i4.i0.u27.p_1_12<1))&&((i4.i1.u14.r_0_14<1)||(i4.i1.u29.r_1_14<1)))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),(((i2.u11.r_0_11>=1)&&(i2.u26.r_1_11>=1))&&(i4.i0.u27.p_1_12>=1)))] != FALSE + [FwdG(Init,((((i2.u11.r_0_11<1)||(i2.u26.r_1_11<1))||(i4.i0.u27.p_1_12<1))&&((i4.i1.u14.r_0_14<1)||(i4.i1.u29.r_1_14<1))))] != FALSE)
(forward)formula 1,0,0.087791,8196,1,0,8475,28,550,9685,47,32,11751
FORMULA ResAllocation-PT-R015C002-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(!(EG(((i1.u7.p_0_7<1)||(i1.u8.r_0_8<1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),((i1.u7.p_0_7<1)||(i1.u8.r_0_8<1)))] = FALSE
(forward)formula 2,0,0.100972,8460,1,0,9819,28,599,11802,48,32,14780
FORMULA ResAllocation-PT-R015C002-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF(((i1.u8.p_0_8>=1)&&(i1.u9.r_0_9>=1))) * AF((i3.i1.u0.r_0_0<1)))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((i1.u8.p_0_8>=1)&&(i1.u9.r_0_9>=1)))))] = FALSE * [FwdG(Init,!((i3.i1.u0.r_0_0<1)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions i3.i1.t_1_0, i4.i1.u14.t_0_15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/30/2/32
(forward)formula 3,1,0.151667,10836,1,0,16339,28,904,18064,56,32,22782
FORMULA ResAllocation-PT-R015C002-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EF((((i2.u11.r_0_11>=1)&&(i2.u26.r_1_11>=1))&&(i4.i0.u27.p_1_12>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i2.u11.r_0_11>=1)&&(i2.u26.r_1_11>=1))&&(i4.i0.u27.p_1_12>=1)))))] = FALSE
(forward)formula 4,0,0.155424,11100,1,0,16576,28,904,18605,56,32,23560
FORMULA ResAllocation-PT-R015C002-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AF(((((i3.i0.u1.r_0_1>=1)&&(i3.i0.u16.r_1_1>=1))&&(i3.i0.u17.p_1_2>=1))||((i2.u10.p_0_10>=1)&&(i2.u11.r_0_11>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((((i3.i0.u1.r_0_1>=1)&&(i3.i0.u16.r_1_1>=1))&&(i3.i0.u17.p_1_2>=1))||((i2.u10.p_0_10>=1)&&(i2.u11.r_0_11>=1)))))] != FALSE
(forward)formula 5,1,0.23568,14532,1,0,24898,28,928,29182,56,32,32113
FORMULA ResAllocation-PT-R015C002-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(AX(((((((i0.i0.u3.p_0_3>=1)&&(i0.i0.u4.r_0_4>=1))&&(i1.u8.r_0_8>=1))&&(i1.u23.r_1_8>=1))&&(i1.u24.p_1_9>=1))&&((i1.u8.p_0_8<1)||(i1.u9.r_0_9<1))))) * !(EG(((i2.u10.p_0_10<1)||(i2.u11.r_0_11<1)))))
=> equivalent forward existential formula: ([(Init * !(EX(!(((((((i0.i0.u3.p_0_3>=1)&&(i0.i0.u4.r_0_4>=1))&&(i1.u8.r_0_8>=1))&&(i1.u23.r_1_8>=1))&&(i1.u24.p_1_9>=1))&&((i1.u8.p_0_8<1)||(i1.u9.r_0_9<1)))))))] = FALSE * [FwdG(Init,((i2.u10.p_0_10<1)||(i2.u11.r_0_11<1)))] = FALSE)
(forward)formula 6,0,0.241508,15060,1,0,25615,28,941,29943,56,32,33532
FORMULA ResAllocation-PT-R015C002-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(AX(EF((((i1.u7.r_0_7>=1)&&(i1.u22.r_1_7>=1))&&(i1.u23.p_1_8>=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U (((i1.u7.r_0_7>=1)&&(i1.u22.r_1_7>=1))&&(i1.u23.p_1_8>=1)))))] = FALSE
(forward)formula 7,0,0.24541,15060,1,0,25956,28,952,30411,56,32,34301
FORMULA ResAllocation-PT-R015C002-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(E(((i4.i1.u14.p_0_14>=1)||(((i0.i1.u5.r_0_5>=1)&&(i0.i1.u20.r_1_5>=1))&&(i0.i1.u21.p_1_6>=1))) U (((i4.i0.u13.r_0_13>=1)&&(i4.i0.u28.r_1_13>=1))&&(i4.i1.u29.p_1_14>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(((i4.i1.u14.p_0_14>=1)||(((i0.i1.u5.r_0_5>=1)&&(i0.i1.u20.r_1_5>=1))&&(i0.i1.u21.p_1_6>=1))) U (((i4.i0.u13.r_0_13>=1)&&(i4.i0.u28.r_1_13>=1))&&(i4.i1.u29.p_1_14>=1)))))] = FALSE
(forward)formula 8,0,0.284659,16380,1,0,29293,28,998,35512,56,32,37511
FORMULA ResAllocation-PT-R015C002-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(A((((((i2.u11.r_0_11<1)||(i2.u26.r_1_11<1))||(i4.i0.u27.p_1_12<1))||(i1.u7.p_0_7<1))||(i1.u8.r_0_8<1)) U ((((((i2.u11.p_0_11>=1)&&(i4.i0.u12.r_0_12>=1))&&(i0.i0.u4.r_0_4>=1))&&(i0.i0.u19.r_1_4>=1))&&(i0.i1.u20.p_1_5>=1))||((i0.i1.u5.p_0_5>=1)&&(i0.i1.u6.r_0_6>=1)))))
=> equivalent forward existential formula: ([(FwdU(Init,!(((((((i2.u11.p_0_11>=1)&&(i4.i0.u12.r_0_12>=1))&&(i0.i0.u4.r_0_4>=1))&&(i0.i0.u19.r_1_4>=1))&&(i0.i1.u20.p_1_5>=1))||((i0.i1.u5.p_0_5>=1)&&(i0.i1.u6.r_0_6>=1))))) * (!((((((i2.u11.r_0_11<1)||(i2.u26.r_1_11<1))||(i4.i0.u27.p_1_12<1))||(i1.u7.p_0_7<1))||(i1.u8.r_0_8<1))) * !(((((((i2.u11.p_0_11>=1)&&(i4.i0.u12.r_0_12>=1))&&(i0.i0.u4.r_0_4>=1))&&(i0.i0.u19.r_1_4>=1))&&(i0.i1.u20.p_1_5>=1))||((i0.i1.u5.p_0_5>=1)&&(i0.i1.u6.r_0_6>=1))))))] != FALSE + [FwdG(Init,!(((((((i2.u11.p_0_11>=1)&&(i4.i0.u12.r_0_12>=1))&&(i0.i0.u4.r_0_4>=1))&&(i0.i0.u19.r_1_4>=1))&&(i0.i1.u20.p_1_5>=1))||((i0.i1.u5.p_0_5>=1)&&(i0.i1.u6.r_0_6>=1)))))] != FALSE)
(forward)formula 9,1,0.338781,18756,1,0,35439,28,1045,43507,56,32,46412
FORMULA ResAllocation-PT-R015C002-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!(EG((((i0.i0.u3.r_0_3>=1)&&(i0.i0.u18.r_1_3>=1))&&(i0.i0.u19.p_1_4>=1)))) U (i3.i1.u15.p_1_0>=1))
=> equivalent forward existential formula: [(FwdU(Init,!(EG((((i0.i0.u3.r_0_3>=1)&&(i0.i0.u18.r_1_3>=1))&&(i0.i0.u19.p_1_4>=1))))) * (i3.i1.u15.p_1_0>=1))] != FALSE
(forward)formula 10,1,0.367099,20076,1,0,38916,28,1065,46319,56,32,50019
FORMULA ResAllocation-PT-R015C002-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AF(((((i1.u8.r_0_8<1)||(i1.u23.r_1_8<1))||(i1.u24.p_1_9<1))&&((i3.i1.u15.p_1_0>=1)||((i0.i1.u5.p_0_5>=1)&&(i0.i1.u6.r_0_6>=1))))) * (EX(((((i4.i0.u13.p_0_13>=1)&&(i4.i1.u14.r_0_14>=1))||(((i4.i0.u13.r_0_13>=1)&&(i4.i0.u28.r_1_13>=1))&&(i4.i1.u29.p_1_14>=1)))||((((((i1.u9.r_0_9>=1)&&(i1.u24.r_1_9>=1))&&(i2.u25.p_1_10>=1))&&(i3.i0.u1.r_0_1>=1))&&(i3.i0.u16.r_1_1>=1))&&(i3.i0.u17.p_1_2>=1)))) + A((((((i1.u7.r_0_7>=1)&&(i1.u22.r_1_7>=1))&&(i1.u23.p_1_8>=1))&&(i3.i0.u2.p_0_2>=1))&&(i0.i0.u3.r_0_3>=1)) U ((((((i1.u7.r_0_7>=1)&&(i1.u22.r_1_7>=1))&&(i1.u23.p_1_8>=1))&&(i2.u10.r_0_10>=1))&&(i2.u25.r_1_10>=1))&&(i2.u26.p_1_11>=1)))))
=> equivalent forward existential formula: ([FwdG(Init,!(((((i1.u8.r_0_8<1)||(i1.u23.r_1_8<1))||(i1.u24.p_1_9<1))&&((i3.i1.u15.p_1_0>=1)||((i0.i1.u5.p_0_5>=1)&&(i0.i1.u6.r_0_6>=1))))))] = FALSE * [((Init * !(!((E(!(((((((i1.u7.r_0_7>=1)&&(i1.u22.r_1_7>=1))&&(i1.u23.p_1_8>=1))&&(i2.u10.r_0_10>=1))&&(i2.u25.r_1_10>=1))&&(i2.u26.p_1_11>=1))) U (!((((((i1.u7.r_0_7>=1)&&(i1.u22.r_1_7>=1))&&(i1.u23.p_1_8>=1))&&(i3.i0.u2.p_0_2>=1))&&(i0.i0.u3.r_0_3>=1))) * !(((((((i1.u7.r_0_7>=1)&&(i1.u22.r_1_7>=1))&&(i1.u23.p_1_8>=1))&&(i2.u10.r_0_10>=1))&&(i2.u25.r_1_10>=1))&&(i2.u26.p_1_11>=1))))) + EG(!(((((((i1.u7.r_0_7>=1)&&(i1.u22.r_1_7>=1))&&(i1.u23.p_1_8>=1))&&(i2.u10.r_0_10>=1))&&(i2.u25.r_1_10>=1))&&(i2.u26.p_1_11>=1)))))))) * !(EX(((((i4.i0.u13.p_0_13>=1)&&(i4.i1.u14.r_0_14>=1))||(((i4.i0.u13.r_0_13>=1)&&(i4.i0.u28.r_1_13>=1))&&(i4.i1.u29.p_1_14>=1)))||((((((i1.u9.r_0_9>=1)&&(i1.u24.r_1_9>=1))&&(i2.u25.p_1_10>=1))&&(i3.i0.u1.r_0_1>=1))&&(i3.i0.u16.r_1_1>=1))&&(i3.i0.u17.p_1_2>=1))))))] = FALSE)
(forward)formula 11,0,0.736002,33012,1,0,63623,28,1157,89055,56,32,80611
FORMULA ResAllocation-PT-R015C002-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((EF(EX(((i1.u7.p_0_7<1)||(i1.u8.r_0_8<1)))) * AF((((i0.i1.u6.p_0_6>=1)&&(i1.u7.r_0_7>=1))||(((i0.i1.u5.r_0_5>=1)&&(i0.i1.u20.r_1_5>=1))&&(i0.i1.u21.p_1_6>=1))))) * EG((i3.i1.u0.r_0_0>=1)))
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EX(((i1.u7.p_0_7<1)||(i1.u8.r_0_8<1))))))] = FALSE * [FwdG(Init,!((((i0.i1.u6.p_0_6>=1)&&(i1.u7.r_0_7>=1))||(((i0.i1.u5.r_0_5>=1)&&(i0.i1.u20.r_1_5>=1))&&(i0.i1.u21.p_1_6>=1)))))] = FALSE) * [(Init * !(EG((i3.i1.u0.r_0_0>=1))))] = FALSE)
(forward)formula 12,0,1.01284,43044,1,0,86205,28,1169,119599,56,32,102398
FORMULA ResAllocation-PT-R015C002-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(((AF(((i2.u11.p_0_11>=1)&&(i4.i0.u12.r_0_12>=1))) + AF(((i3.i0.u2.p_0_2>=1)&&(i0.i0.u3.r_0_3>=1)))) + EX((((i0.i1.u6.r_0_6>=1)&&(i0.i1.u21.r_1_6>=1))&&(i1.u22.p_1_7>=1)))))
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!(((i2.u11.p_0_11>=1)&&(i4.i0.u12.r_0_12>=1))))) + !(EG(!(((i3.i0.u2.p_0_2>=1)&&(i0.i0.u3.r_0_3>=1)))))) + EX((((i0.i1.u6.r_0_6>=1)&&(i0.i1.u21.r_1_6>=1))&&(i1.u22.p_1_7>=1)))))] != FALSE
(forward)formula 13,0,1.4548,58620,1,0,120331,28,1212,160934,56,32,135551
FORMULA ResAllocation-PT-R015C002-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(EX(EX((((i3.i0.u1.r_0_1>=1)&&(i3.i0.u16.r_1_1>=1))&&(i3.i0.u17.p_1_2>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EX((((i3.i0.u1.r_0_1>=1)&&(i3.i0.u16.r_1_1>=1))&&(i3.i0.u17.p_1_2>=1))))))] = FALSE
(forward)formula 14,0,1.53442,61260,1,0,126231,28,1215,169431,56,32,139687
FORMULA ResAllocation-PT-R015C002-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1590556237171

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ResAllocation-PT-R015C002"
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"

# 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 ResAllocation-PT-R015C002, 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 r193-csrt-159033389200716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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