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-158940145300588.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-COL-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-oct2-158940145300588
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 2.8K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 3.7K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 38K 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-COL-2-CTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1589590473345

[2020-05-16 00:54:37] [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 00:54:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 00:54:37] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-16 00:54:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1215 ms
[2020-05-16 00:54:38] [INFO ] sort/places :
pid * pid->wait,done,
pid * bool->b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

[2020-05-16 00:54:38] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 69 PT places and 117.0 transition bindings in 24 ms.
[2020-05-16 00:54:38] [INFO ] Computed order based on color domains.
[2020-05-16 00:54:38] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions in 35 ms.
[2020-05-16 00:54:38] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 128 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 267 ms. (steps per millisecond=374 ) properties seen :[1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
[2020-05-16 00:54:38] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2020-05-16 00:54:38] [INFO ] Computed 10 place invariants in 6 ms
[2020-05-16 00:54:39] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2020-05-16 00:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:54:39] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2020-05-16 00:54:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-05-16 00:54:39] [INFO ] [Real]Added 20 Read/Feed constraints in 32 ms returned sat
[2020-05-16 00:54:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:54:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 58 ms returned sat
[2020-05-16 00:54:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:54:39] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2020-05-16 00:54:39] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-05-16 00:54:40] [INFO ] Deduced a trap composed of 11 places in 932 ms
[2020-05-16 00:54:40] [INFO ] Deduced a trap composed of 17 places in 26 ms
[2020-05-16 00:54:41] [INFO ] Deduced a trap composed of 12 places in 159 ms
[2020-05-16 00:54:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1192 ms
[2020-05-16 00:54:41] [INFO ] Computed and/alt/rep : 60/172/54 causal constraints in 30 ms.
[2020-05-16 00:54:41] [INFO ] Added : 53 causal constraints over 11 iterations in 294 ms. Result :sat
[2020-05-16 00:54:41] [INFO ] [Real]Absence check using 10 positive place invariants in 76 ms returned sat
[2020-05-16 00:54:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:54:41] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2020-05-16 00:54:41] [INFO ] [Real]Added 20 Read/Feed constraints in 8 ms returned sat
[2020-05-16 00:54:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:54:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2020-05-16 00:54:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:54:41] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2020-05-16 00:54:41] [INFO ] [Nat]Added 20 Read/Feed constraints in 7 ms returned sat
[2020-05-16 00:54:41] [INFO ] Deduced a trap composed of 15 places in 54 ms
[2020-05-16 00:54:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2020-05-16 00:54:41] [INFO ] Computed and/alt/rep : 60/172/54 causal constraints in 6 ms.
[2020-05-16 00:54:42] [INFO ] Added : 52 causal constraints over 11 iterations in 125 ms. Result :sat
[2020-05-16 00:54:42] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
[2020-05-16 00:54:42] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-05-16 00:54:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:54:42] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2020-05-16 00:54:42] [INFO ] [Real]Added 20 Read/Feed constraints in 26 ms returned sat
[2020-05-16 00:54:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:54:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 70 ms returned sat
[2020-05-16 00:54:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:54:43] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2020-05-16 00:54:43] [INFO ] [Nat]Added 20 Read/Feed constraints in 13 ms returned sat
[2020-05-16 00:54:43] [INFO ] Deduced a trap composed of 8 places in 30 ms
[2020-05-16 00:54:43] [INFO ] Deduced a trap composed of 12 places in 54 ms
[2020-05-16 00:54:43] [INFO ] Deduced a trap composed of 12 places in 45 ms
[2020-05-16 00:54:44] [INFO ] Deduced a trap composed of 8 places in 745 ms
[2020-05-16 00:54:44] [INFO ] Deduced a trap composed of 14 places in 193 ms
[2020-05-16 00:54:44] [INFO ] Deduced a trap composed of 9 places in 369 ms
[2020-05-16 00:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 1485 ms
[2020-05-16 00:54:44] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2020-05-16 00:54:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:54:44] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-05-16 00:54:44] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-05-16 00:54:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:54:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 77 ms returned sat
[2020-05-16 00:54:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:54:45] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2020-05-16 00:54:45] [INFO ] [Nat]Added 20 Read/Feed constraints in 29 ms returned sat
[2020-05-16 00:54:45] [INFO ] Deduced a trap composed of 9 places in 29 ms
[2020-05-16 00:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2020-05-16 00:54:45] [INFO ] [Real]Absence check using 10 positive place invariants in 29 ms returned sat
[2020-05-16 00:54:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:54:45] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-05-16 00:54:45] [INFO ] [Real]Added 20 Read/Feed constraints in 1 ms returned sat
[2020-05-16 00:54:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:54:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-05-16 00:54:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:54:45] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-05-16 00:54:45] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2020-05-16 00:54:45] [INFO ] Deduced a trap composed of 9 places in 34 ms
[2020-05-16 00:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 63 ms
[2020-05-16 00:54:45] [INFO ] [Real]Absence check using 10 positive place invariants in 66 ms returned sat
[2020-05-16 00:54:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:54:45] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2020-05-16 00:54:45] [INFO ] [Real]Added 20 Read/Feed constraints in 35 ms returned sat
[2020-05-16 00:54:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:54:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 72 ms returned sat
[2020-05-16 00:54:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:54:46] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2020-05-16 00:54:46] [INFO ] [Nat]Added 20 Read/Feed constraints in 27 ms returned sat
[2020-05-16 00:54:46] [INFO ] Deduced a trap composed of 8 places in 26 ms
[2020-05-16 00:54:46] [INFO ] Deduced a trap composed of 8 places in 25 ms
[2020-05-16 00:54:46] [INFO ] Deduced a trap composed of 8 places in 41 ms
[2020-05-16 00:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 114 ms
[2020-05-16 00:54:46] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-05-16 00:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 00:54:47] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2020-05-16 00:54:47] [INFO ] [Real]Added 20 Read/Feed constraints in 29 ms returned sat
[2020-05-16 00:54:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 00:54:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 70 ms returned sat
[2020-05-16 00:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-16 00:54:47] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2020-05-16 00:54:47] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-05-16 00:54:47] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2020-05-16 00:54:48] [INFO ] Deduced a trap composed of 14 places in 461 ms
[2020-05-16 00:54:48] [INFO ] Deduced a trap composed of 8 places in 633 ms
[2020-05-16 00:54:49] [INFO ] Deduced a trap composed of 13 places in 35 ms
[2020-05-16 00:54:49] [INFO ] Deduced a trap composed of 11 places in 25 ms
[2020-05-16 00:54:49] [INFO ] Deduced a trap composed of 9 places in 191 ms
[2020-05-16 00:54:49] [INFO ] Deduced a trap composed of 9 places in 92 ms
[2020-05-16 00:54:49] [INFO ] Deduced a trap composed of 11 places in 21 ms
[2020-05-16 00:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 1599 ms
[2020-05-16 00:54:49] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-05-16 00:54:49] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-16 00:54:49] [INFO ] Flatten gal took : 61 ms
[2020-05-16 00:54:49] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-05-16 00:54:49] [INFO ] Flatten gal took : 9 ms
FORMULA LamportFastMutEx-COL-2-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 00:54:49] [INFO ] Applying decomposition
[2020-05-16 00:54:49] [INFO ] Flatten gal took : 22 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/graph11232692296944560008.txt, -o, /tmp/graph11232692296944560008.bin, -w, /tmp/graph11232692296944560008.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/graph11232692296944560008.bin, -l, -1, -v, -w, /tmp/graph11232692296944560008.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 00:54:49] [INFO ] Decomposing Gal with order
[2020-05-16 00:54:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 00:54:49] [INFO ] Removed a total of 50 redundant transitions.
[2020-05-16 00:54:49] [INFO ] Flatten gal took : 68 ms
[2020-05-16 00:54:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 16 ms.
[2020-05-16 00:54:49] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 2 ms
[2020-05-16 00:54:49] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 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 8 CTL formulae.
built 16 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 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.040257,5384,192,67,1476,273,211,2504,77,672,0


Converting to forward existential form...Done !
original formula: !(AG((AG(((((i4.u8.P_await_13_1>=1)&&(i4.u8.done_4>=1))&&(i4.u9.done_5>=1))||(((u7.P_await_13_2>=1)&&(u7.done_7>=1))&&(u7.done_8>=1)))) + AF((((((i5.u4.y_2>=1)&&(i0.u0.P_ifyi_15_1>=1))||((i5.u4.y_0>=1)&&(i0.u0.P_ifyi_15_1>=1)))||((i5.u4.y_1>=1)&&(u7.P_ifyi_15_2>=1)))||((i5.u4.y_0>=1)&&(u7.P_ifyi_15_2>=1)))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!(E(TRUE U !(((((i4.u8.P_await_13_1>=1)&&(i4.u8.done_4>=1))&&(i4.u9.done_5>=1))||(((u7.P_await_13_2>=1)&&(u7.done_7>=1))&&(u7.done_8>=1)))))))),!((((((i5.u4.y_2>=1)&&(i0.u0.P_ifyi_15_1>=1))||((i5.u4.y_0>=1)&&(i0.u0.P_ifyi_15_1>=1)))||((i5.u4.y_1>=1)&&(u7.P_ifyi_15_2>=1)))||((i5.u4.y_0>=1)&&(u7.P_ifyi_15_2>=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions T_setx_3i1x0, T_setx_3i1x2, T_setx_3i2x0, T_setx_3i2x1, T_awaityi1, T_awaityi2, T_sety_9i2y1, T_ynei_15i1y0, T_ynei_15i1y2, T_ynei_15i2y0, T_ynei_15i2y1, T_yeqi_15i1, T_yeqi_15i2, T_setbi_24bi0i2, T_setbi_24bi1i1, i0.T_setbi_5bi0i1, i0.T_setbi_2bi0i1, i0.u2.T_setx_3i1x1, i1.T_setbi_5bi1i2, i1.T_setbi_2bi1i2, i1.u3.T_setx_3i2x2, i5.T_sety0_23i2y2, i5.T_sety0_23i1y2, i5.u4.T_sety_9i1y0, i5.u4.T_sety_9i1y2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :10/18/25/53
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
(forward)formula 0,1,0.078648,7088,1,0,4283,513,921,8315,358,1547,12362
FORMULA LamportFastMutEx-COL-2-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(EX(((((((((((i0.u2.x_1<1)||(i5.u4.P_ifxi_10_1<1))&&((i1.u3.x_2<1)||(u5.P_ifxi_10_2<1)))&&((i5.u4.y_1<1)||(i5.u11.P_CS_21_2<1)))&&((i5.u4.y_0<1)||(i5.u10.P_CS_21_1<1)))&&((i5.u4.y_0<1)||(i5.u11.P_CS_21_2<1)))&&((i5.u4.y_2<1)||(i5.u10.P_CS_21_1<1)))&&((i5.u4.y_2<1)||(i5.u11.P_CS_21_2<1)))&&((i5.u4.y_1<1)||(i5.u10.P_CS_21_1<1))) * AG(((i4.u6.P_fordo_12_1>=1)||(u7.P_fordo_12_2>=1))))))
=> equivalent forward existential formula: [((EY(Init) * (((((((((i0.u2.x_1<1)||(i5.u4.P_ifxi_10_1<1))&&((i1.u3.x_2<1)||(u5.P_ifxi_10_2<1)))&&((i5.u4.y_1<1)||(i5.u11.P_CS_21_2<1)))&&((i5.u4.y_0<1)||(i5.u10.P_CS_21_1<1)))&&((i5.u4.y_0<1)||(i5.u11.P_CS_21_2<1)))&&((i5.u4.y_2<1)||(i5.u10.P_CS_21_1<1)))&&((i5.u4.y_2<1)||(i5.u11.P_CS_21_2<1)))&&((i5.u4.y_1<1)||(i5.u10.P_CS_21_1<1)))) * !(E(TRUE U !(((i4.u6.P_fordo_12_1>=1)||(u7.P_fordo_12_2>=1))))))] = FALSE
(forward)formula 1,1,0.079471,7352,1,0,4300,513,925,8335,358,1548,12470
FORMULA LamportFastMutEx-COL-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.079649,7352,1,0,4319,513,925,8346,358,1548,12650
FORMULA LamportFastMutEx-COL-2-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (A(((((((((((i4.u8.P_await_13_1>=1)&&(i4.u8.done_4>=1))&&(i4.u9.done_5>=1))||(((u7.P_await_13_2>=1)&&(u7.done_7>=1))&&(u7.done_8>=1)))||((i5.u4.y_2>=1)&&(i0.u0.P_ifyi_15_1>=1)))||((i5.u4.y_0>=1)&&(i0.u0.P_ifyi_15_1>=1)))||((i5.u4.y_1>=1)&&(u7.P_ifyi_15_2>=1)))||((i5.u4.y_0>=1)&&(u7.P_ifyi_15_2>=1)))||((i5.u4.y_0>=1)&&(i0.u0.P_awaity_1>=1)))||((i5.u4.y_0>=1)&&(i1.u1.P_awaity_2>=1))) U (((((((((((((i1.u1.P_start_1_2>=1)&&(i1.u1.b_5>=1))||((i1.u1.P_start_1_2>=1)&&(i1.u1.b_4>=1)))||((i0.u0.P_start_1_1>=1)&&(i0.u0.b_3>=1)))||((i0.u0.P_start_1_1>=1)&&(i0.u0.b_2>=1)))||((i5.u4.y_1>=1)&&(i0.u2.P_ify0_4_1>=1)))||((i5.u4.y_1>=1)&&(i1.u3.P_ify0_4_2>=1)))||((i5.u4.y_2>=1)&&(i0.u2.P_ify0_4_1>=1)))||((i5.u4.y_2>=1)&&(i1.u3.P_ify0_4_2>=1)))||((i1.u1.b_4>=1)&&(u5.P_setbi_11_2>=1)))||((i0.u0.b_3>=1)&&(i4.u6.P_setbi_11_1>=1)))||((i1.u1.b_5>=1)&&(u5.P_setbi_11_2>=1)))||((i0.u0.b_2>=1)&&(i4.u6.P_setbi_11_1>=1)))) * EG((((((((i0.u2.x_1<1)||(i1.u3.P_setx_3_2<1))&&((i0.u2.x_1<1)||(i0.u2.P_setx_3_1<1)))&&((i1.u3.x_2<1)||(i0.u2.P_setx_3_1<1)))&&((i1.u3.x_2<1)||(i1.u3.P_setx_3_2<1)))&&((i4.u6.x_0<1)||(i1.u3.P_setx_3_2<1)))&&((i4.u6.x_0<1)||(i0.u2.P_setx_3_1<1)))))
=> equivalent forward existential formula: [FwdG((Init * !((E(!((((((((((((((i1.u1.P_start_1_2>=1)&&(i1.u1.b_5>=1))||((i1.u1.P_start_1_2>=1)&&(i1.u1.b_4>=1)))||((i0.u0.P_start_1_1>=1)&&(i0.u0.b_3>=1)))||((i0.u0.P_start_1_1>=1)&&(i0.u0.b_2>=1)))||((i5.u4.y_1>=1)&&(i0.u2.P_ify0_4_1>=1)))||((i5.u4.y_1>=1)&&(i1.u3.P_ify0_4_2>=1)))||((i5.u4.y_2>=1)&&(i0.u2.P_ify0_4_1>=1)))||((i5.u4.y_2>=1)&&(i1.u3.P_ify0_4_2>=1)))||((i1.u1.b_4>=1)&&(u5.P_setbi_11_2>=1)))||((i0.u0.b_3>=1)&&(i4.u6.P_setbi_11_1>=1)))||((i1.u1.b_5>=1)&&(u5.P_setbi_11_2>=1)))||((i0.u0.b_2>=1)&&(i4.u6.P_setbi_11_1>=1)))) U (!(((((((((((i4.u8.P_await_13_1>=1)&&(i4.u8.done_4>=1))&&(i4.u9.done_5>=1))||(((u7.P_await_13_2>=1)&&(u7.done_7>=1))&&(u7.done_8>=1)))||((i5.u4.y_2>=1)&&(i0.u0.P_ifyi_15_1>=1)))||((i5.u4.y_0>=1)&&(i0.u0.P_ifyi_15_1>=1)))||((i5.u4.y_1>=1)&&(u7.P_ifyi_15_2>=1)))||((i5.u4.y_0>=1)&&(u7.P_ifyi_15_2>=1)))||((i5.u4.y_0>=1)&&(i0.u0.P_awaity_1>=1)))||((i5.u4.y_0>=1)&&(i1.u1.P_awaity_2>=1)))) * !((((((((((((((i1.u1.P_start_1_2>=1)&&(i1.u1.b_5>=1))||((i1.u1.P_start_1_2>=1)&&(i1.u1.b_4>=1)))||((i0.u0.P_start_1_1>=1)&&(i0.u0.b_3>=1)))||((i0.u0.P_start_1_1>=1)&&(i0.u0.b_2>=1)))||((i5.u4.y_1>=1)&&(i0.u2.P_ify0_4_1>=1)))||((i5.u4.y_1>=1)&&(i1.u3.P_ify0_4_2>=1)))||((i5.u4.y_2>=1)&&(i0.u2.P_ify0_4_1>=1)))||((i5.u4.y_2>=1)&&(i1.u3.P_ify0_4_2>=1)))||((i1.u1.b_4>=1)&&(u5.P_setbi_11_2>=1)))||((i0.u0.b_3>=1)&&(i4.u6.P_setbi_11_1>=1)))||((i1.u1.b_5>=1)&&(u5.P_setbi_11_2>=1)))||((i0.u0.b_2>=1)&&(i4.u6.P_setbi_11_1>=1)))))) + EG(!((((((((((((((i1.u1.P_start_1_2>=1)&&(i1.u1.b_5>=1))||((i1.u1.P_start_1_2>=1)&&(i1.u1.b_4>=1)))||((i0.u0.P_start_1_1>=1)&&(i0.u0.b_3>=1)))||((i0.u0.P_start_1_1>=1)&&(i0.u0.b_2>=1)))||((i5.u4.y_1>=1)&&(i0.u2.P_ify0_4_1>=1)))||((i5.u4.y_1>=1)&&(i1.u3.P_ify0_4_2>=1)))||((i5.u4.y_2>=1)&&(i0.u2.P_ify0_4_1>=1)))||((i5.u4.y_2>=1)&&(i1.u3.P_ify0_4_2>=1)))||((i1.u1.b_4>=1)&&(u5.P_setbi_11_2>=1)))||((i0.u0.b_3>=1)&&(i4.u6.P_setbi_11_1>=1)))||((i1.u1.b_5>=1)&&(u5.P_setbi_11_2>=1)))||((i0.u0.b_2>=1)&&(i4.u6.P_setbi_11_1>=1)))))))),(((((((i0.u2.x_1<1)||(i1.u3.P_setx_3_2<1))&&((i0.u2.x_1<1)||(i0.u2.P_setx_3_1<1)))&&((i1.u3.x_2<1)||(i0.u2.P_setx_3_1<1)))&&((i1.u3.x_2<1)||(i1.u3.P_setx_3_2<1)))&&((i4.u6.x_0<1)||(i1.u3.P_setx_3_2<1)))&&((i4.u6.x_0<1)||(i0.u2.P_setx_3_1<1))))] != FALSE
(forward)formula 3,0,0.115245,8672,1,0,7325,564,1114,12000,380,1702,21646
FORMULA LamportFastMutEx-COL-2-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EX((((i0.u2.x_1<1)||(i5.u4.P_ifxi_10_1<1))&&((i1.u3.x_2<1)||(u5.P_ifxi_10_2<1)))))
=> equivalent forward existential formula: [(EY(Init) * (((i0.u2.x_1<1)||(i5.u4.P_ifxi_10_1<1))&&((i1.u3.x_2<1)||(u5.P_ifxi_10_2<1))))] = FALSE
(forward)formula 4,0,0.116282,8936,1,0,7356,564,1122,12087,381,1704,21748
FORMULA LamportFastMutEx-COL-2-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(AG((((i0.u2.x_1>=1)&&(i5.u4.P_ifxi_10_1>=1))||((i1.u3.x_2>=1)&&(u5.P_ifxi_10_2>=1))))) * (!(AF((((((i4.u6.x_0>=1)&&(u5.P_ifxi_10_2>=1))||((i1.u3.x_2>=1)&&(i5.u4.P_ifxi_10_1>=1)))||((i4.u6.x_0>=1)&&(i5.u4.P_ifxi_10_1>=1)))||((i0.u2.x_1>=1)&&(u5.P_ifxi_10_2>=1))))) + EX((((((i5.u4.y_2<1)||(i0.u0.P_ifyi_15_1<1))&&((i5.u4.y_0<1)||(i0.u0.P_ifyi_15_1<1)))&&((i5.u4.y_1<1)||(u7.P_ifyi_15_2<1)))&&((i5.u4.y_0<1)||(u7.P_ifyi_15_2<1))))))
=> equivalent forward existential formula: ([FwdG((Init * !(!(E(TRUE U !((((i0.u2.x_1>=1)&&(i5.u4.P_ifxi_10_1>=1))||((i1.u3.x_2>=1)&&(u5.P_ifxi_10_2>=1)))))))),!((((((i4.u6.x_0>=1)&&(u5.P_ifxi_10_2>=1))||((i1.u3.x_2>=1)&&(i5.u4.P_ifxi_10_1>=1)))||((i4.u6.x_0>=1)&&(i5.u4.P_ifxi_10_1>=1)))||((i0.u2.x_1>=1)&&(u5.P_ifxi_10_2>=1)))))] != FALSE + [(EY((Init * !(!(E(TRUE U !((((i0.u2.x_1>=1)&&(i5.u4.P_ifxi_10_1>=1))||((i1.u3.x_2>=1)&&(u5.P_ifxi_10_2>=1))))))))) * (((((i5.u4.y_2<1)||(i0.u0.P_ifyi_15_1<1))&&((i5.u4.y_0<1)||(i0.u0.P_ifyi_15_1<1)))&&((i5.u4.y_1<1)||(u7.P_ifyi_15_2<1)))&&((i5.u4.y_0<1)||(u7.P_ifyi_15_2<1))))] != FALSE)
(forward)formula 5,1,0.127336,9200,1,0,8279,569,1161,13143,381,1719,25087
FORMULA LamportFastMutEx-COL-2-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EX((((((((i5.u4.y_2>=1)&&(u5.P_sety_9_2>=1))||((i5.u4.y_0>=1)&&(i5.u4.P_sety_9_1>=1)))||((i5.u4.y_2>=1)&&(i5.u4.P_sety_9_1>=1)))||((i5.u4.y_1>=1)&&(i5.u4.P_sety_9_1>=1)))||((i5.u4.y_1>=1)&&(u5.P_sety_9_2>=1)))||((i5.u4.y_0>=1)&&(u5.P_sety_9_2>=1)))) + EF(((((i0.u2.x_1>=1)&&(i5.u4.P_ifxi_10_1>=1))||((i1.u3.x_2>=1)&&(u5.P_ifxi_10_2>=1)))||((((((i1.u1.b_4>=1)&&(u5.P_setbi_11_2>=1))||((i0.u0.b_3>=1)&&(i4.u6.P_setbi_11_1>=1)))||((i1.u1.b_5>=1)&&(u5.P_setbi_11_2>=1)))||((i0.u0.b_2>=1)&&(i4.u6.P_setbi_11_1>=1)))&&(((((i0.u0.b_3>=1)&&(i5.u10.P_setbi_24_1>=1))||((i1.u1.b_5>=1)&&(i5.u11.P_setbi_24_2>=1)))||((i1.u1.b_4>=1)&&(i5.u11.P_setbi_24_2>=1)))||((i0.u0.b_2>=1)&&(i5.u10.P_setbi_24_1>=1)))))))
=> equivalent forward existential formula: ([(EY(Init) * (((((((i5.u4.y_2>=1)&&(u5.P_sety_9_2>=1))||((i5.u4.y_0>=1)&&(i5.u4.P_sety_9_1>=1)))||((i5.u4.y_2>=1)&&(i5.u4.P_sety_9_1>=1)))||((i5.u4.y_1>=1)&&(i5.u4.P_sety_9_1>=1)))||((i5.u4.y_1>=1)&&(u5.P_sety_9_2>=1)))||((i5.u4.y_0>=1)&&(u5.P_sety_9_2>=1))))] != FALSE + [(FwdU(Init,TRUE) * ((((i0.u2.x_1>=1)&&(i5.u4.P_ifxi_10_1>=1))||((i1.u3.x_2>=1)&&(u5.P_ifxi_10_2>=1)))||((((((i1.u1.b_4>=1)&&(u5.P_setbi_11_2>=1))||((i0.u0.b_3>=1)&&(i4.u6.P_setbi_11_1>=1)))||((i1.u1.b_5>=1)&&(u5.P_setbi_11_2>=1)))||((i0.u0.b_2>=1)&&(i4.u6.P_setbi_11_1>=1)))&&(((((i0.u0.b_3>=1)&&(i5.u10.P_setbi_24_1>=1))||((i1.u1.b_5>=1)&&(i5.u11.P_setbi_24_2>=1)))||((i1.u1.b_4>=1)&&(i5.u11.P_setbi_24_2>=1)))||((i0.u0.b_2>=1)&&(i5.u10.P_setbi_24_1>=1))))))] != FALSE)
(forward)formula 6,1,0.131364,9464,1,0,8298,569,1228,13189,390,1719,25294
FORMULA LamportFastMutEx-COL-2-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(EX((((((((i5.u4.y_1>=1)&&(i5.u11.P_CS_21_2>=1))||((i5.u4.y_0>=1)&&(i5.u10.P_CS_21_1>=1)))||((i5.u4.y_0>=1)&&(i5.u11.P_CS_21_2>=1)))||((i5.u4.y_2>=1)&&(i5.u10.P_CS_21_1>=1)))||((i5.u4.y_2>=1)&&(i5.u11.P_CS_21_2>=1)))||((i5.u4.y_1>=1)&&(i5.u10.P_CS_21_1>=1)))) U ((i4.u6.P_fordo_12_1>=1)||(u7.P_fordo_12_2>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((i4.u6.P_fordo_12_1>=1)||(u7.P_fordo_12_2>=1)))))) * !(E(!(((i4.u6.P_fordo_12_1>=1)||(u7.P_fordo_12_2>=1))) U (!(EX((((((((i5.u4.y_1>=1)&&(i5.u11.P_CS_21_2>=1))||((i5.u4.y_0>=1)&&(i5.u10.P_CS_21_1>=1)))||((i5.u4.y_0>=1)&&(i5.u11.P_CS_21_2>=1)))||((i5.u4.y_2>=1)&&(i5.u10.P_CS_21_1>=1)))||((i5.u4.y_2>=1)&&(i5.u11.P_CS_21_2>=1)))||((i5.u4.y_1>=1)&&(i5.u10.P_CS_21_1>=1))))) * !(((i4.u6.P_fordo_12_1>=1)||(u7.P_fordo_12_2>=1)))))))] != FALSE
(forward)formula 7,0,0.150524,9992,1,0,9723,586,1284,15379,390,1772,29126
FORMULA LamportFastMutEx-COL-2-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1589590490965

--------------------
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-COL-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-COL-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-158940145300588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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