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.r184-oct2-158987928800622.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 itslola
Input is LamportFastMutEx-COL-6, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928800622
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.4K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.5K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 42K 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-6-ReachabilityCardinality-00
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-01
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-02
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-03
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-04
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-05
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-06
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-07
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-08
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-09
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-10
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-11
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-12
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-13
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-14
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591216253179

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:30:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:30:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:30:54] [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-06-03 20:30:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 471 ms
[2020-06-03 20:30:55] [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-06-03 20:30:55] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 37 ms.
[2020-06-03 20:30:55] [INFO ] Computed order based on color domains.
[2020-06-03 20:30:55] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions in 19 ms.
[2020-06-03 20:30:55] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1]
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 1, 0, 0, 0]
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0]
[2020-06-03 20:30:55] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2020-06-03 20:30:55] [INFO ] Computed 50 place invariants in 10 ms
[2020-06-03 20:30:55] [INFO ] [Real]Absence check using 50 positive place invariants in 23 ms returned sat
[2020-06-03 20:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:55] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2020-06-03 20:30:55] [INFO ] State equation strengthened by 84 read => feed constraints.
[2020-06-03 20:30:55] [INFO ] [Real]Added 84 Read/Feed constraints in 12 ms returned sat
[2020-06-03 20:30:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:30:55] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2020-06-03 20:30:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:56] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2020-06-03 20:30:56] [INFO ] [Nat]Added 84 Read/Feed constraints in 10 ms returned sat
[2020-06-03 20:30:56] [INFO ] Deduced a trap composed of 14 places in 126 ms
[2020-06-03 20:30:56] [INFO ] Deduced a trap composed of 13 places in 93 ms
[2020-06-03 20:30:56] [INFO ] Deduced a trap composed of 9 places in 47 ms
[2020-06-03 20:30:56] [INFO ] Deduced a trap composed of 8 places in 30 ms
[2020-06-03 20:30:56] [INFO ] Deduced a trap composed of 14 places in 75 ms
[2020-06-03 20:30:56] [INFO ] Deduced a trap composed of 21 places in 125 ms
[2020-06-03 20:30:56] [INFO ] Deduced a trap composed of 9 places in 39 ms
[2020-06-03 20:30:56] [INFO ] Deduced a trap composed of 9 places in 15 ms
[2020-06-03 20:30:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 674 ms
[2020-06-03 20:30:56] [INFO ] Computed and/alt/rep : 348/2412/258 causal constraints in 24 ms.
[2020-06-03 20:30:57] [INFO ] Added : 233 causal constraints over 47 iterations in 1127 ms. Result :sat
[2020-06-03 20:30:57] [INFO ] Deduced a trap composed of 9 places in 52 ms
[2020-06-03 20:30:57] [INFO ] Deduced a trap composed of 18 places in 58 ms
[2020-06-03 20:30:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-06-03 20:30:58] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2020-06-03 20:30:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:58] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2020-06-03 20:30:58] [INFO ] [Real]Added 84 Read/Feed constraints in 12 ms returned sat
[2020-06-03 20:30:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:30:58] [INFO ] [Nat]Absence check using 50 positive place invariants in 23 ms returned sat
[2020-06-03 20:30:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:30:58] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2020-06-03 20:30:58] [INFO ] [Nat]Added 84 Read/Feed constraints in 9 ms returned sat
[2020-06-03 20:30:58] [INFO ] Deduced a trap composed of 10 places in 145 ms
[2020-06-03 20:30:58] [INFO ] Deduced a trap composed of 24 places in 59 ms
[2020-06-03 20:30:58] [INFO ] Deduced a trap composed of 25 places in 55 ms
[2020-06-03 20:30:58] [INFO ] Deduced a trap composed of 30 places in 79 ms
[2020-06-03 20:30:58] [INFO ] Deduced a trap composed of 29 places in 43 ms
[2020-06-03 20:30:58] [INFO ] Deduced a trap composed of 15 places in 29 ms
[2020-06-03 20:30:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 484 ms
[2020-06-03 20:30:58] [INFO ] Computed and/alt/rep : 348/2412/258 causal constraints in 14 ms.
[2020-06-03 20:30:59] [INFO ] Added : 230 causal constraints over 47 iterations in 1018 ms. Result :sat
[2020-06-03 20:31:00] [INFO ] Deduced a trap composed of 9 places in 42 ms
[2020-06-03 20:31:00] [INFO ] Deduced a trap composed of 9 places in 33 ms
[2020-06-03 20:31:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-06-03 20:31:00] [INFO ] [Real]Absence check using 50 positive place invariants in 5 ms returned unsat
[2020-06-03 20:31:00] [INFO ] [Real]Absence check using 50 positive place invariants in 4 ms returned unsat
[2020-06-03 20:31:00] [INFO ] [Real]Absence check using 50 positive place invariants in 14 ms returned sat
[2020-06-03 20:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:31:00] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2020-06-03 20:31:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:31:00] [INFO ] [Nat]Absence check using 50 positive place invariants in 18 ms returned sat
[2020-06-03 20:31:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:31:00] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-06-03 20:31:00] [INFO ] [Nat]Added 84 Read/Feed constraints in 10 ms returned sat
[2020-06-03 20:31:00] [INFO ] Deduced a trap composed of 19 places in 56 ms
[2020-06-03 20:31:00] [INFO ] Deduced a trap composed of 26 places in 55 ms
[2020-06-03 20:31:00] [INFO ] Deduced a trap composed of 33 places in 51 ms
[2020-06-03 20:31:00] [INFO ] Deduced a trap composed of 9 places in 40 ms
[2020-06-03 20:31:00] [INFO ] Deduced a trap composed of 9 places in 42 ms
[2020-06-03 20:31:00] [INFO ] Deduced a trap composed of 15 places in 47 ms
[2020-06-03 20:31:00] [INFO ] Deduced a trap composed of 9 places in 41 ms
[2020-06-03 20:31:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 410 ms
[2020-06-03 20:31:00] [INFO ] Computed and/alt/rep : 348/2412/258 causal constraints in 12 ms.
[2020-06-03 20:31:01] [INFO ] Added : 188 causal constraints over 39 iterations in 843 ms. Result :sat
[2020-06-03 20:31:01] [INFO ] Deduced a trap composed of 9 places in 37 ms
[2020-06-03 20:31:01] [INFO ] Deduced a trap composed of 15 places in 59 ms
[2020-06-03 20:31:01] [INFO ] Deduced a trap composed of 15 places in 25 ms
[2020-06-03 20:31:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 202 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 49700 steps, including 998 resets, run finished after 134 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 76100 steps, including 1000 resets, run finished after 145 ms. (steps per millisecond=524 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 55400 steps, including 999 resets, run finished after 111 ms. (steps per millisecond=499 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 96 out of 176 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 30 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1920 ms. (steps per millisecond=520 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 720 ms. (steps per millisecond=1388 ) properties seen :[1, 0, 0]
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1423 ms. (steps per millisecond=702 ) properties seen :[0, 1]
FORMULA LamportFastMutEx-COL-6-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2020-06-03 20:31:07] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2020-06-03 20:31:07] [INFO ] Computed 50 place invariants in 3 ms
[2020-06-03 20:31:07] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2020-06-03 20:31:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:31:07] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2020-06-03 20:31:07] [INFO ] State equation strengthened by 84 read => feed constraints.
[2020-06-03 20:31:07] [INFO ] [Real]Added 84 Read/Feed constraints in 10 ms returned sat
[2020-06-03 20:31:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:31:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned sat
[2020-06-03 20:31:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:31:07] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2020-06-03 20:31:07] [INFO ] [Nat]Added 84 Read/Feed constraints in 10 ms returned sat
[2020-06-03 20:31:07] [INFO ] Deduced a trap composed of 10 places in 76 ms
[2020-06-03 20:31:07] [INFO ] Deduced a trap composed of 24 places in 54 ms
[2020-06-03 20:31:07] [INFO ] Deduced a trap composed of 25 places in 56 ms
[2020-06-03 20:31:07] [INFO ] Deduced a trap composed of 30 places in 45 ms
[2020-06-03 20:31:07] [INFO ] Deduced a trap composed of 29 places in 54 ms
[2020-06-03 20:31:08] [INFO ] Deduced a trap composed of 15 places in 28 ms
[2020-06-03 20:31:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 372 ms
[2020-06-03 20:31:08] [INFO ] Computed and/alt/rep : 348/2412/258 causal constraints in 12 ms.
[2020-06-03 20:31:09] [INFO ] Added : 230 causal constraints over 47 iterations in 1057 ms. Result :sat
[2020-06-03 20:31:09] [INFO ] Deduced a trap composed of 9 places in 97 ms
[2020-06-03 20:31:09] [INFO ] Deduced a trap composed of 9 places in 50 ms
[2020-06-03 20:31:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
Attempting to minimize the solution found.
Minimization took 48 ms.
Incomplete Parikh walk after 76100 steps, including 1000 resets, run finished after 129 ms. (steps per millisecond=589 ) properties seen :[0] could not realise parikh vector
Support contains 30 out of 176 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 8 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1611 ms. (steps per millisecond=620 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 797 ms. (steps per millisecond=1254 ) properties seen :[0]
Interrupted probabilistic random walk after 19961881 steps, run timeout after 30001 ms. (steps per millisecond=665 ) properties seen :[0]
Probabilistic random walk after 19961881 steps, saw 3307373 distinct states, run finished after 30003 ms. (steps per millisecond=665 ) properties seen :[0]
[2020-06-03 20:31:41] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2020-06-03 20:31:41] [INFO ] Computed 50 place invariants in 2 ms
[2020-06-03 20:31:41] [INFO ] [Real]Absence check using 50 positive place invariants in 24 ms returned sat
[2020-06-03 20:31:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:31:42] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-03 20:31:42] [INFO ] State equation strengthened by 84 read => feed constraints.
[2020-06-03 20:31:42] [INFO ] [Real]Added 84 Read/Feed constraints in 13 ms returned sat
[2020-06-03 20:31:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:31:42] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned sat
[2020-06-03 20:31:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:31:42] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2020-06-03 20:31:42] [INFO ] [Nat]Added 84 Read/Feed constraints in 9 ms returned sat
[2020-06-03 20:31:42] [INFO ] Deduced a trap composed of 10 places in 53 ms
[2020-06-03 20:31:42] [INFO ] Deduced a trap composed of 24 places in 46 ms
[2020-06-03 20:31:42] [INFO ] Deduced a trap composed of 25 places in 55 ms
[2020-06-03 20:31:42] [INFO ] Deduced a trap composed of 30 places in 43 ms
[2020-06-03 20:31:42] [INFO ] Deduced a trap composed of 29 places in 48 ms
[2020-06-03 20:31:42] [INFO ] Deduced a trap composed of 15 places in 32 ms
[2020-06-03 20:31:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 324 ms
[2020-06-03 20:31:42] [INFO ] Computed and/alt/rep : 348/2412/258 causal constraints in 11 ms.
[2020-06-03 20:31:43] [INFO ] Added : 230 causal constraints over 47 iterations in 976 ms. Result :sat
[2020-06-03 20:31:43] [INFO ] Deduced a trap composed of 9 places in 35 ms
[2020-06-03 20:31:43] [INFO ] Deduced a trap composed of 9 places in 35 ms
[2020-06-03 20:31:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 76100 steps, including 1000 resets, run finished after 124 ms. (steps per millisecond=613 ) properties seen :[0] could not realise parikh vector
Support contains 30 out of 176 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 7 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Starting structural reductions, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 8 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2020-06-03 20:31:43] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2020-06-03 20:31:43] [INFO ] Computed 50 place invariants in 1 ms
[2020-06-03 20:31:43] [INFO ] Implicit Places using invariants in 129 ms returned []
[2020-06-03 20:31:43] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2020-06-03 20:31:43] [INFO ] Computed 50 place invariants in 2 ms
[2020-06-03 20:31:44] [INFO ] State equation strengthened by 84 read => feed constraints.
[2020-06-03 20:31:44] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2020-06-03 20:31:44] [INFO ] Redundant transitions in 12 ms returned []
[2020-06-03 20:31:44] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2020-06-03 20:31:44] [INFO ] Computed 50 place invariants in 1 ms
[2020-06-03 20:31:44] [INFO ] Dead Transitions using invariants and state equation in 231 ms returned []
Finished structural reductions, in 1 iterations. Remains : 176/176 places, 354/354 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 156 ms. (steps per millisecond=641 ) properties seen :[0]
[2020-06-03 20:31:44] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2020-06-03 20:31:44] [INFO ] Computed 50 place invariants in 1 ms
[2020-06-03 20:31:44] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2020-06-03 20:31:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:31:45] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2020-06-03 20:31:45] [INFO ] State equation strengthened by 84 read => feed constraints.
[2020-06-03 20:31:45] [INFO ] [Real]Added 84 Read/Feed constraints in 11 ms returned sat
[2020-06-03 20:31:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:31:45] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2020-06-03 20:31:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:31:45] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2020-06-03 20:31:45] [INFO ] [Nat]Added 84 Read/Feed constraints in 10 ms returned sat
[2020-06-03 20:31:45] [INFO ] Deduced a trap composed of 10 places in 61 ms
[2020-06-03 20:31:45] [INFO ] Deduced a trap composed of 24 places in 43 ms
[2020-06-03 20:31:45] [INFO ] Deduced a trap composed of 25 places in 48 ms
[2020-06-03 20:31:45] [INFO ] Deduced a trap composed of 30 places in 47 ms
[2020-06-03 20:31:45] [INFO ] Deduced a trap composed of 29 places in 42 ms
[2020-06-03 20:31:45] [INFO ] Deduced a trap composed of 15 places in 53 ms
[2020-06-03 20:31:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 341 ms
[2020-06-03 20:31:45] [INFO ] Computed and/alt/rep : 348/2412/258 causal constraints in 13 ms.
[2020-06-03 20:31:46] [INFO ] Added : 230 causal constraints over 47 iterations in 994 ms. Result :sat
[2020-06-03 20:31:46] [INFO ] Deduced a trap composed of 9 places in 35 ms
[2020-06-03 20:31:46] [INFO ] Deduced a trap composed of 9 places in 33 ms
[2020-06-03 20:31:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 176 transition count 264
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 90 place count 176 transition count 228
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 36 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 1 with 108 rules applied. Total rules applied 198 place count 104 transition count 228
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 210 place count 98 transition count 258
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 216 place count 98 transition count 252
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 222 place count 92 transition count 252
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 234 place count 92 transition count 252
Applied a total of 234 rules in 23 ms. Remains 92 /176 variables (removed 84) and now considering 252/354 (removed 102) transitions.
// Phase 1: matrix 252 rows 92 cols
[2020-06-03 20:31:46] [INFO ] Computed 14 place invariants in 1 ms
[2020-06-03 20:31:46] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2020-06-03 20:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:31:46] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-06-03 20:31:46] [INFO ] Computed and/alt/rep : 240/2010/240 causal constraints in 20 ms.
[2020-06-03 20:31:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:31:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2020-06-03 20:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:31:46] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-06-03 20:31:46] [INFO ] Computed and/alt/rep : 240/2010/240 causal constraints in 10 ms.
[2020-06-03 20:31:47] [INFO ] Added : 192 causal constraints over 39 iterations in 824 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-06-03 20:31:47] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2020-06-03 20:31:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
[2020-06-03 20:31:47] [INFO ] Flatten gal took : 50 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ LamportFastMutEx-COL-6 @ 3570 seconds
vrfy: finished
info: timeLeft: 3568
rslt: Output for ReachabilityCardinality @ LamportFastMutEx-COL-6

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 20:31:48 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 19508,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "E (F (((p0 + p1 + p2 + p3 + p4 + p5 <= 0) AND (p170 + p171 + p172 + p173 + p174 + p175 <= p110 + p111 + p112 + p113 + p114 + p115) AND (p164 + p165 + p166 + p167 + p168 + p169 <= 1) AND (p68 + p69 + p70 + p71 + p72 + p73 <= p170 + p171 + p172 + p173 + p174 + p175) AND ((6 <= p0 + p1 + p2 + p3 + p4 + p5) OR (3 <= p170 + p171 + p172 + p173 + p174 + p175)))))",
"processed_size": 359,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 1536,
"conflict_clusters": 9,
"places": 176,
"places_significant": 126,
"singleton_clusters": 0,
"transitions": 354
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 530/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 176
lola: finding significant places
lola: 176 places, 354 transitions, 126 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: E (F (((p0 + p1 + p2 + p3 + p4 + p5 <= 0) AND (p170 + p171 + p172 + p173 + p174 + p175 <= p110 + p111 + p112 + p113 + p114 + p115) AND (p164 + p165 + p166 + p167 + p168 + p169 <= 1) AND (p68 + p69 + p70 + p71 + p72 + p73 <= p170 + p171 + p172 + p173 + p174 + p175) AND ((6 <= p0 + p1 + p2 + p3 + p4 + p5) OR (3 <= p170 + p171 + p172 + p173 + p174 + p175)))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p0 + p1 + p2 + p3 + p4 + p5 <= 0) AND (p170 + p171 + p172 + p173 + p174 + p175 <= p110 + p111 + p112 + p113 + p114 + p115) AND (p164 + p165 + p166 + p167 + p168 + p169 <= 1) AND (p68 + p69 + p70 + p71 + p72 + p73 <= p170 + p171 + p172 + p173 + p174 + p175) AND ((6 <= p0 + p1 + p2 + p3 + p4 + p5) OR (3 <= p170 + p171 + p172 + p173 + p174 + p175)))))
lola: processed formula length: 359
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: local time limit reached - aborting
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 + p1 + p2 + p3 + p4 + p5 <= 0) AND (p170 + p171 + p172 + p173 + p174 + p175 <= p110 + p111 + p112 + p113 + p114 + p115) AND (p164 + p165 + p166 + p167 + p168 + p169 <= 1) AND (p68 + p69 + p70 + p71 + p72 + p73 <= p170 + p171 + p172 + p173 + p174 + p175) AND ((6 <= p0 + p1 + p2 + p3 + p4 + p5) OR (3 <= p170 + p171 + p172 + p173 + p174 + p175)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 19508 KB
lola: time consumption: 2 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

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

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-6"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
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 itslola"
echo " Input is LamportFastMutEx-COL-6, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-oct2-158987928800622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-6.tgz
mv LamportFastMutEx-COL-6 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;