Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 3.7K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:04 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 6 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 46K Apr 30 13:04 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 LamportFastMutEx-PT-2-CTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589592946279

[2020-05-16 01:35:49] [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-16 01:35:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 01:35:49] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2020-05-16 01:35:49] [INFO ] Transformed 69 places.
[2020-05-16 01:35:49] [INFO ] Transformed 96 transitions.
[2020-05-16 01:35:49] [INFO ] Parsed PT model containing 69 places and 96 transitions in 146 ms.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 34 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 63 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 262 ms. (steps per millisecond=381 ) properties seen :[1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-16 01:35:49] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2020-05-16 01:35:49] [INFO ] Computed 10 place invariants in 4 ms
[2020-05-16 01:35:49] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2020-05-16 01:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:35:49] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-05-16 01:35:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-05-16 01:35:49] [INFO ] [Real]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-05-16 01:35:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:35:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2020-05-16 01:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:35:49] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2020-05-16 01:35:50] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-05-16 01:35:50] [INFO ] Deduced a trap composed of 15 places in 90 ms
[2020-05-16 01:35:50] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2020-05-16 01:35:50] [INFO ] Deduced a trap composed of 17 places in 69 ms
[2020-05-16 01:35:50] [INFO ] Deduced a trap composed of 12 places in 82 ms
[2020-05-16 01:35:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 428 ms
[2020-05-16 01:35:50] [INFO ] Computed and/alt/rep : 60/172/54 causal constraints in 3 ms.
[2020-05-16 01:35:50] [INFO ] Added : 52 causal constraints over 11 iterations in 263 ms. Result :sat
[2020-05-16 01:35:50] [INFO ] [Real]Absence check using 10 positive place invariants in 58 ms returned sat
[2020-05-16 01:35:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:35:51] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2020-05-16 01:35:51] [INFO ] [Real]Added 20 Read/Feed constraints in 23 ms returned sat
[2020-05-16 01:35:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:35:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 47 ms returned sat
[2020-05-16 01:35:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:35:51] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2020-05-16 01:35:51] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-05-16 01:35:51] [INFO ] Computed and/alt/rep : 60/172/54 causal constraints in 6 ms.
[2020-05-16 01:35:51] [INFO ] Added : 52 causal constraints over 11 iterations in 239 ms. Result :sat
[2020-05-16 01:35:51] [INFO ] Deduced a trap composed of 14 places in 95 ms
[2020-05-16 01:35:51] [INFO ] Deduced a trap composed of 11 places in 20 ms
[2020-05-16 01:35:51] [INFO ] Deduced a trap composed of 12 places in 27 ms
[2020-05-16 01:35:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 181 ms
[2020-05-16 01:35:51] [INFO ] [Real]Absence check using 10 positive place invariants in 34 ms returned unsat
[2020-05-16 01:35:51] [INFO ] [Real]Absence check using 10 positive place invariants in 43 ms returned sat
[2020-05-16 01:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:35:51] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2020-05-16 01:35:51] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-05-16 01:35:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:35:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 65 ms returned sat
[2020-05-16 01:35:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:35:51] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-05-16 01:35:51] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-05-16 01:35:52] [INFO ] Deduced a trap composed of 9 places in 39 ms
[2020-05-16 01:35:52] [INFO ] Deduced a trap composed of 10 places in 119 ms
[2020-05-16 01:35:52] [INFO ] Deduced a trap composed of 11 places in 28 ms
[2020-05-16 01:35:52] [INFO ] Deduced a trap composed of 14 places in 22 ms
[2020-05-16 01:35:52] [INFO ] Deduced a trap composed of 11 places in 26 ms
[2020-05-16 01:35:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 266 ms
[2020-05-16 01:35:52] [INFO ] Computed and/alt/rep : 60/172/54 causal constraints in 2 ms.
[2020-05-16 01:35:52] [INFO ] Added : 53 causal constraints over 11 iterations in 71 ms. Result :sat
[2020-05-16 01:35:52] [INFO ] Deduced a trap composed of 9 places in 171 ms
[2020-05-16 01:35:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 176 ms
[2020-05-16 01:35:52] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-05-16 01:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:35:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-05-16 01:35:52] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-05-16 01:35:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:35:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 69 ms returned sat
[2020-05-16 01:35:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:35:52] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2020-05-16 01:35:52] [INFO ] [Nat]Added 20 Read/Feed constraints in 13 ms returned sat
[2020-05-16 01:35:52] [INFO ] Deduced a trap composed of 9 places in 38 ms
[2020-05-16 01:35:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2020-05-16 01:35:52] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-05-16 01:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:35:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-05-16 01:35:52] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-05-16 01:35:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:35:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2020-05-16 01:35:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:35:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-05-16 01:35:52] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-05-16 01:35:53] [INFO ] Deduced a trap composed of 9 places in 243 ms
[2020-05-16 01:35:53] [INFO ] Deduced a trap composed of 9 places in 26 ms
[2020-05-16 01:35:53] [INFO ] Deduced a trap composed of 12 places in 28 ms
[2020-05-16 01:35:53] [INFO ] Deduced a trap composed of 8 places in 18 ms
[2020-05-16 01:35:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 333 ms
[2020-05-16 01:35:53] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2020-05-16 01:35:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:35:53] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-05-16 01:35:53] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-05-16 01:35:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:35:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-05-16 01:35:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:35:53] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2020-05-16 01:35:53] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2020-05-16 01:35:53] [INFO ] Deduced a trap composed of 8 places in 21 ms
[2020-05-16 01:35:53] [INFO ] Deduced a trap composed of 15 places in 160 ms
[2020-05-16 01:35:53] [INFO ] Deduced a trap composed of 14 places in 44 ms
[2020-05-16 01:35:53] [INFO ] Deduced a trap composed of 8 places in 14 ms
[2020-05-16 01:35:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 312 ms
[2020-05-16 01:35:53] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-05-16 01:35:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 01:35:54] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-05-16 01:35:54] [INFO ] [Real]Added 20 Read/Feed constraints in 14 ms returned sat
[2020-05-16 01:35:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 01:35:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2020-05-16 01:35:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 01:35:54] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2020-05-16 01:35:54] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-05-16 01:35:54] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2020-05-16 01:35:54] [INFO ] Deduced a trap composed of 14 places in 16 ms
[2020-05-16 01:35:54] [INFO ] Deduced a trap composed of 8 places in 13 ms
[2020-05-16 01:35:54] [INFO ] Deduced a trap composed of 13 places in 247 ms
[2020-05-16 01:35:54] [INFO ] Deduced a trap composed of 11 places in 23 ms
[2020-05-16 01:35:54] [INFO ] Deduced a trap composed of 9 places in 20 ms
[2020-05-16 01:35:54] [INFO ] Deduced a trap composed of 9 places in 40 ms
[2020-05-16 01:35:54] [INFO ] Deduced a trap composed of 11 places in 37 ms
[2020-05-16 01:35:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 530 ms
[2020-05-16 01:35:54] [INFO ] [Real]Absence check using 10 positive place invariants in 28 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-05-16 01:35:54] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-05-16 01:35:54] [INFO ] Flatten gal took : 34 ms
[2020-05-16 01:35:54] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-05-16 01:35:54] [INFO ] Flatten gal took : 11 ms
FORMULA LamportFastMutEx-PT-2-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 01:35:54] [INFO ] Applying decomposition
[2020-05-16 01:35:54] [INFO ] Flatten gal took : 8 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/graph11814008500051247263.txt, -o, /tmp/graph11814008500051247263.bin, -w, /tmp/graph11814008500051247263.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/graph11814008500051247263.bin, -l, -1, -v, -w, /tmp/graph11814008500051247263.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 01:35:55] [INFO ] Decomposing Gal with order
[2020-05-16 01:35:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 01:35:55] [INFO ] Removed a total of 53 redundant transitions.
[2020-05-16 01:35:55] [INFO ] Flatten gal took : 100 ms
[2020-05-16 01:35:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 5 ms.
[2020-05-16 01:35:55] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 2 ms
[2020-05-16 01:35:55] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 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 6 CTL formulae.
built 3 ordering constraints for composite.
built 21 ordering constraints for composite.
built 18 ordering constraints for composite.
built 15 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,380,0.056699,5600,220,61,2339,340,229,3500,71,943,0


Converting to forward existential form...Done !
original formula: !(AG((AG(((((i1.u8.P_await_13_1>=1)&&(i1.u8.P_done_1_1>=1))&&(i1.u9.P_done_1_2>=1))||(((i2.u7.P_await_13_2>=1)&&(i2.u7.P_done_2_1>=1))&&(i2.u7.P_done_2_2>=1)))) + AF((((((i0.u0.y_2>=1)&&(i1.u1.P_ifyi_15_1>=1))||((i0.u0.y_0>=1)&&(i1.u1.P_ifyi_15_1>=1)))||((i0.u0.y_1>=1)&&(i2.u7.P_ifyi_15_2>=1)))||((i0.u0.y_0>=1)&&(i2.u7.P_ifyi_15_2>=1)))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!(E(TRUE U !(((((i1.u8.P_await_13_1>=1)&&(i1.u8.P_done_1_1>=1))&&(i1.u9.P_done_1_2>=1))||(((i2.u7.P_await_13_2>=1)&&(i2.u7.P_done_2_1>=1))&&(i2.u7.P_done_2_2>=1)))))))),!((((((i0.u0.y_2>=1)&&(i1.u1.P_ifyi_15_1>=1))||((i0.u0.y_0>=1)&&(i1.u1.P_ifyi_15_1>=1)))||((i0.u0.y_1>=1)&&(i2.u7.P_ifyi_15_2>=1)))||((i0.u0.y_0>=1)&&(i2.u7.P_ifyi_15_2>=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions T_setx_3_4, T_setx_3_6, T_setx_3_7, T_setx_3_8, T_awaity_2, T_awaity_3, T_ynei_15_4, T_ynei_15_6, T_ynei_15_7, T_ynei_15_8, T_yeqi_15_5, T_yeqi_15_9, T_setbi_24_4, T_setbi_24_5, i0.T_sety0_23_8, i0.T_sety0_23_5, i0.T_sety_9_8, i0.T_sety_9_6, i1.T_setbi_5_3, i1.T_setbi_2_4, i1.u4.T_setx_3_5, i2.T_setbi_5_5, i2.T_setbi_2_6, i2.u3.T_setx_3_9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :10/18/24/52
Fast SCC detection found an SCC at level 2
(forward)formula 0,1,0.091846,6828,1,0,3867,423,926,9020,312,1136,10229
FORMULA LamportFastMutEx-PT-2-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(EX(((((((((((i1.u4.x_1<1)||(i0.u6.P_ifxi_10_1<1))&&((i2.u3.x_2<1)||(i0.u5.P_ifxi_10_2<1)))&&((i0.u0.y_1<1)||(i0.u11.P_CS_21_2<1)))&&((i0.u0.y_0<1)||(i0.u10.P_CS_21_1<1)))&&((i0.u0.y_0<1)||(i0.u11.P_CS_21_2<1)))&&((i0.u0.y_2<1)||(i0.u10.P_CS_21_1<1)))&&((i0.u0.y_2<1)||(i0.u11.P_CS_21_2<1)))&&((i0.u0.y_1<1)||(i0.u10.P_CS_21_1<1))) * AG(((i1.u8.P_fordo_12_1>=1)||(i2.u7.P_fordo_12_2>=1))))))
=> equivalent forward existential formula: [((EY(Init) * (((((((((i1.u4.x_1<1)||(i0.u6.P_ifxi_10_1<1))&&((i2.u3.x_2<1)||(i0.u5.P_ifxi_10_2<1)))&&((i0.u0.y_1<1)||(i0.u11.P_CS_21_2<1)))&&((i0.u0.y_0<1)||(i0.u10.P_CS_21_1<1)))&&((i0.u0.y_0<1)||(i0.u11.P_CS_21_2<1)))&&((i0.u0.y_2<1)||(i0.u10.P_CS_21_1<1)))&&((i0.u0.y_2<1)||(i0.u11.P_CS_21_2<1)))&&((i0.u0.y_1<1)||(i0.u10.P_CS_21_1<1)))) * !(E(TRUE U !(((i1.u8.P_fordo_12_1>=1)||(i2.u7.P_fordo_12_2>=1))))))] = FALSE
(forward)formula 1,1,0.092733,7092,1,0,3877,423,932,9033,312,1137,10315
FORMULA LamportFastMutEx-PT-2-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(EX(TRUE))
=> equivalent forward existential formula: [(EY(EY(Init)) * TRUE)] != FALSE
(forward)formula 2,1,0.092911,7092,1,0,3897,423,932,9046,312,1137,10486
FORMULA LamportFastMutEx-PT-2-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (A(((((((((((i1.u8.P_await_13_1>=1)&&(i1.u8.P_done_1_1>=1))&&(i1.u9.P_done_1_2>=1))||(((i2.u7.P_await_13_2>=1)&&(i2.u7.P_done_2_1>=1))&&(i2.u7.P_done_2_2>=1)))||((i0.u0.y_2>=1)&&(i1.u1.P_ifyi_15_1>=1)))||((i0.u0.y_0>=1)&&(i1.u1.P_ifyi_15_1>=1)))||((i0.u0.y_1>=1)&&(i2.u7.P_ifyi_15_2>=1)))||((i0.u0.y_0>=1)&&(i2.u7.P_ifyi_15_2>=1)))||((i0.u0.y_0>=1)&&(i1.u1.P_awaity_1>=1)))||((i0.u0.y_0>=1)&&(i2.u2.P_awaity_2>=1))) U (((((((((((((i2.u2.P_start_1_2>=1)&&(i2.u2.P_b_2_true>=1))||((i1.u1.P_start_1_1>=1)&&(i1.u1.P_b_1_true>=1)))||((i2.u2.P_start_1_2>=1)&&(i2.u2.P_b_2_false>=1)))||((i1.u1.P_start_1_1>=1)&&(i1.u1.P_b_1_false>=1)))||((i0.u0.y_1>=1)&&(i1.u4.P_ify0_4_1>=1)))||((i0.u0.y_1>=1)&&(i2.u3.P_ify0_4_2>=1)))||((i0.u0.y_2>=1)&&(i1.u4.P_ify0_4_1>=1)))||((i0.u0.y_2>=1)&&(i2.u3.P_ify0_4_2>=1)))||((i2.u2.P_b_2_false>=1)&&(i0.u5.P_setbi_11_2>=1)))||((i1.u1.P_b_1_true>=1)&&(i0.u6.P_setbi_11_1>=1)))||((i2.u2.P_b_2_true>=1)&&(i0.u5.P_setbi_11_2>=1)))||((i1.u1.P_b_1_false>=1)&&(i0.u6.P_setbi_11_1>=1)))) * EG((((((((i1.u4.x_1<1)||(i2.u3.P_setx_3_2<1))&&((i1.u4.x_1<1)||(i1.u4.P_setx_3_1<1)))&&((i2.u3.x_2<1)||(i1.u4.P_setx_3_1<1)))&&((i2.u3.x_2<1)||(i2.u3.P_setx_3_2<1)))&&((i0.u5.x_0<1)||(i2.u3.P_setx_3_2<1)))&&((i0.u5.x_0<1)||(i1.u4.P_setx_3_1<1)))))
=> equivalent forward existential formula: [FwdG((Init * !((E(!((((((((((((((i2.u2.P_start_1_2>=1)&&(i2.u2.P_b_2_true>=1))||((i1.u1.P_start_1_1>=1)&&(i1.u1.P_b_1_true>=1)))||((i2.u2.P_start_1_2>=1)&&(i2.u2.P_b_2_false>=1)))||((i1.u1.P_start_1_1>=1)&&(i1.u1.P_b_1_false>=1)))||((i0.u0.y_1>=1)&&(i1.u4.P_ify0_4_1>=1)))||((i0.u0.y_1>=1)&&(i2.u3.P_ify0_4_2>=1)))||((i0.u0.y_2>=1)&&(i1.u4.P_ify0_4_1>=1)))||((i0.u0.y_2>=1)&&(i2.u3.P_ify0_4_2>=1)))||((i2.u2.P_b_2_false>=1)&&(i0.u5.P_setbi_11_2>=1)))||((i1.u1.P_b_1_true>=1)&&(i0.u6.P_setbi_11_1>=1)))||((i2.u2.P_b_2_true>=1)&&(i0.u5.P_setbi_11_2>=1)))||((i1.u1.P_b_1_false>=1)&&(i0.u6.P_setbi_11_1>=1)))) U (!(((((((((((i1.u8.P_await_13_1>=1)&&(i1.u8.P_done_1_1>=1))&&(i1.u9.P_done_1_2>=1))||(((i2.u7.P_await_13_2>=1)&&(i2.u7.P_done_2_1>=1))&&(i2.u7.P_done_2_2>=1)))||((i0.u0.y_2>=1)&&(i1.u1.P_ifyi_15_1>=1)))||((i0.u0.y_0>=1)&&(i1.u1.P_ifyi_15_1>=1)))||((i0.u0.y_1>=1)&&(i2.u7.P_ifyi_15_2>=1)))||((i0.u0.y_0>=1)&&(i2.u7.P_ifyi_15_2>=1)))||((i0.u0.y_0>=1)&&(i1.u1.P_awaity_1>=1)))||((i0.u0.y_0>=1)&&(i2.u2.P_awaity_2>=1)))) * !((((((((((((((i2.u2.P_start_1_2>=1)&&(i2.u2.P_b_2_true>=1))||((i1.u1.P_start_1_1>=1)&&(i1.u1.P_b_1_true>=1)))||((i2.u2.P_start_1_2>=1)&&(i2.u2.P_b_2_false>=1)))||((i1.u1.P_start_1_1>=1)&&(i1.u1.P_b_1_false>=1)))||((i0.u0.y_1>=1)&&(i1.u4.P_ify0_4_1>=1)))||((i0.u0.y_1>=1)&&(i2.u3.P_ify0_4_2>=1)))||((i0.u0.y_2>=1)&&(i1.u4.P_ify0_4_1>=1)))||((i0.u0.y_2>=1)&&(i2.u3.P_ify0_4_2>=1)))||((i2.u2.P_b_2_false>=1)&&(i0.u5.P_setbi_11_2>=1)))||((i1.u1.P_b_1_true>=1)&&(i0.u6.P_setbi_11_1>=1)))||((i2.u2.P_b_2_true>=1)&&(i0.u5.P_setbi_11_2>=1)))||((i1.u1.P_b_1_false>=1)&&(i0.u6.P_setbi_11_1>=1)))))) + EG(!((((((((((((((i2.u2.P_start_1_2>=1)&&(i2.u2.P_b_2_true>=1))||((i1.u1.P_start_1_1>=1)&&(i1.u1.P_b_1_true>=1)))||((i2.u2.P_start_1_2>=1)&&(i2.u2.P_b_2_false>=1)))||((i1.u1.P_start_1_1>=1)&&(i1.u1.P_b_1_false>=1)))||((i0.u0.y_1>=1)&&(i1.u4.P_ify0_4_1>=1)))||((i0.u0.y_1>=1)&&(i2.u3.P_ify0_4_2>=1)))||((i0.u0.y_2>=1)&&(i1.u4.P_ify0_4_1>=1)))||((i0.u0.y_2>=1)&&(i2.u3.P_ify0_4_2>=1)))||((i2.u2.P_b_2_false>=1)&&(i0.u5.P_setbi_11_2>=1)))||((i1.u1.P_b_1_true>=1)&&(i0.u6.P_setbi_11_1>=1)))||((i2.u2.P_b_2_true>=1)&&(i0.u5.P_setbi_11_2>=1)))||((i1.u1.P_b_1_false>=1)&&(i0.u6.P_setbi_11_1>=1)))))))),(((((((i1.u4.x_1<1)||(i2.u3.P_setx_3_2<1))&&((i1.u4.x_1<1)||(i1.u4.P_setx_3_1<1)))&&((i2.u3.x_2<1)||(i1.u4.P_setx_3_1<1)))&&((i2.u3.x_2<1)||(i2.u3.P_setx_3_2<1)))&&((i0.u5.x_0<1)||(i2.u3.P_setx_3_2<1)))&&((i0.u5.x_0<1)||(i1.u4.P_setx_3_1<1))))] != FALSE
(forward)formula 3,0,0.180685,8940,1,0,7370,494,1075,16398,326,1416,20904
FORMULA LamportFastMutEx-PT-2-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(((EX((((i0.u0.y_2>=1)&&(i0.u6.P_sety_9_1>=1))||((i0.u0.y_0>=1)&&(i1.u4.P_ify0_4_1>=1)))) * (i2.u7.P_fordo_12_2>=1)) * (((((i0.u0.y_2<1)||(i0.u11.P_CS_21_2<1))||(i1.u8.P_await_13_1<1))||(i1.u8.P_done_1_1<1))||(i1.u9.P_done_1_2<1))))
=> equivalent forward existential formula: (([(EY(Init) * !(EX((((i0.u0.y_2>=1)&&(i0.u6.P_sety_9_1>=1))||((i0.u0.y_0>=1)&&(i1.u4.P_ify0_4_1>=1))))))] = FALSE * [(EY(Init) * !((i2.u7.P_fordo_12_2>=1)))] = FALSE) * [(EY(Init) * !((((((i0.u0.y_2<1)||(i0.u11.P_CS_21_2<1))||(i1.u8.P_await_13_1<1))||(i1.u8.P_done_1_1<1))||(i1.u9.P_done_1_2<1))))] = FALSE)
(forward)formula 4,0,0.198214,9204,1,0,7407,494,1099,16496,329,1417,21149
FORMULA LamportFastMutEx-PT-2-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX((((i2.u2.P_b_2_false>=1)&&(i2.u7.P_wait_2_2>=1))&&(i2.u7.P_await_13_2>=1)))
=> equivalent forward existential formula: [(EY(Init) * (((i2.u2.P_b_2_false>=1)&&(i2.u7.P_wait_2_2>=1))&&(i2.u7.P_await_13_2>=1)))] != FALSE
(forward)formula 5,0,0.199487,9204,1,0,7407,494,1113,16497,331,1417,21173
FORMULA LamportFastMutEx-PT-2-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1589592955920

--------------------
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="LamportFastMutEx-PT-2"
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 LamportFastMutEx-PT-2, 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 r096-oct2-158940145400644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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