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-158987928900694.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-PT-8, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928900694
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 7.9K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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 18K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K 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 317K 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-8-ReachabilityCardinality-00
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-01
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-02
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-03
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-04
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-05
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-06
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-07
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-08
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-09
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-10
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-11
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-12
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-13
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-14
FORMULA_NAME LamportFastMutEx-PT-8-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591219832281

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:30:33] [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 21:30:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:30:33] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2020-06-03 21:30:33] [INFO ] Transformed 315 places.
[2020-06-03 21:30:33] [INFO ] Transformed 666 transitions.
[2020-06-03 21:30:33] [INFO ] Parsed PT model containing 315 places and 666 transitions in 112 ms.
Deduced a syphon composed of 49 places in 5 ms
Reduce places removed 49 places and 82 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0]
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 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, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 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, 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, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-06-03 21:30:33] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 21:30:33] [INFO ] Computed 82 place invariants in 10 ms
[2020-06-03 21:30:34] [INFO ] [Real]Absence check using 82 positive place invariants in 31 ms returned sat
[2020-06-03 21:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:30:34] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2020-06-03 21:30:34] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-06-03 21:30:34] [INFO ] [Real]Added 128 Read/Feed constraints in 27 ms returned sat
[2020-06-03 21:30:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:30:34] [INFO ] [Nat]Absence check using 82 positive place invariants in 35 ms returned sat
[2020-06-03 21:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:30:34] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2020-06-03 21:30:34] [INFO ] [Nat]Added 128 Read/Feed constraints in 29 ms returned sat
[2020-06-03 21:30:34] [INFO ] Deduced a trap composed of 54 places in 119 ms
[2020-06-03 21:30:34] [INFO ] Deduced a trap composed of 9 places in 85 ms
[2020-06-03 21:30:35] [INFO ] Deduced a trap composed of 9 places in 90 ms
[2020-06-03 21:30:35] [INFO ] Deduced a trap composed of 9 places in 90 ms
[2020-06-03 21:30:35] [INFO ] Deduced a trap composed of 9 places in 94 ms
[2020-06-03 21:30:35] [INFO ] Deduced a trap composed of 17 places in 88 ms
[2020-06-03 21:30:35] [INFO ] Deduced a trap composed of 51 places in 119 ms
[2020-06-03 21:30:35] [INFO ] Deduced a trap composed of 54 places in 86 ms
[2020-06-03 21:30:35] [INFO ] Deduced a trap composed of 66 places in 81 ms
[2020-06-03 21:30:35] [INFO ] Deduced a trap composed of 64 places in 91 ms
[2020-06-03 21:30:35] [INFO ] Deduced a trap composed of 46 places in 80 ms
[2020-06-03 21:30:36] [INFO ] Deduced a trap composed of 50 places in 80 ms
[2020-06-03 21:30:36] [INFO ] Deduced a trap composed of 33 places in 90 ms
[2020-06-03 21:30:36] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1439 ms
[2020-06-03 21:30:36] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 31 ms.
[2020-06-03 21:30:39] [INFO ] Added : 365 causal constraints over 73 iterations in 3277 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 21:30:39] [INFO ] [Real]Absence check using 82 positive place invariants in 23 ms returned sat
[2020-06-03 21:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:30:39] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2020-06-03 21:30:39] [INFO ] [Real]Added 128 Read/Feed constraints in 21 ms returned sat
[2020-06-03 21:30:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:30:39] [INFO ] [Nat]Absence check using 82 positive place invariants in 24 ms returned sat
[2020-06-03 21:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:30:40] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2020-06-03 21:30:40] [INFO ] [Nat]Added 128 Read/Feed constraints in 16 ms returned sat
[2020-06-03 21:30:40] [INFO ] Deduced a trap composed of 9 places in 117 ms
[2020-06-03 21:30:40] [INFO ] Deduced a trap composed of 8 places in 93 ms
[2020-06-03 21:30:40] [INFO ] Deduced a trap composed of 42 places in 97 ms
[2020-06-03 21:30:40] [INFO ] Deduced a trap composed of 43 places in 100 ms
[2020-06-03 21:30:40] [INFO ] Deduced a trap composed of 44 places in 95 ms
[2020-06-03 21:30:40] [INFO ] Deduced a trap composed of 42 places in 100 ms
[2020-06-03 21:30:40] [INFO ] Deduced a trap composed of 23 places in 68 ms
[2020-06-03 21:30:40] [INFO ] Deduced a trap composed of 16 places in 73 ms
[2020-06-03 21:30:40] [INFO ] Deduced a trap composed of 22 places in 68 ms
[2020-06-03 21:30:41] [INFO ] Deduced a trap composed of 15 places in 75 ms
[2020-06-03 21:30:41] [INFO ] Deduced a trap composed of 17 places in 72 ms
[2020-06-03 21:30:41] [INFO ] Deduced a trap composed of 15 places in 68 ms
[2020-06-03 21:30:41] [INFO ] Deduced a trap composed of 41 places in 98 ms
[2020-06-03 21:30:41] [INFO ] Deduced a trap composed of 9 places in 94 ms
[2020-06-03 21:30:41] [INFO ] Deduced a trap composed of 8 places in 95 ms
[2020-06-03 21:30:41] [INFO ] Deduced a trap composed of 8 places in 91 ms
[2020-06-03 21:30:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1649 ms
[2020-06-03 21:30:41] [INFO ] [Real]Absence check using 82 positive place invariants in 6 ms returned unsat
[2020-06-03 21:30:41] [INFO ] [Real]Absence check using 82 positive place invariants in 21 ms returned unsat
[2020-06-03 21:30:41] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned unsat
[2020-06-03 21:30:41] [INFO ] [Real]Absence check using 82 positive place invariants in 10 ms returned unsat
[2020-06-03 21:30:41] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned unsat
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LamportFastMutEx-PT-8-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 24 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 32 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 584/584 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2054 ms. (steps per millisecond=486 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 910 ms. (steps per millisecond=1098 ) properties seen :[0]
Interrupted probabilistic random walk after 13854542 steps, run timeout after 30001 ms. (steps per millisecond=461 ) properties seen :[0]
Probabilistic random walk after 13854542 steps, saw 1725765 distinct states, run finished after 30001 ms. (steps per millisecond=461 ) properties seen :[0]
[2020-06-03 21:31:14] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 21:31:14] [INFO ] Computed 82 place invariants in 3 ms
[2020-06-03 21:31:14] [INFO ] [Real]Absence check using 82 positive place invariants in 24 ms returned sat
[2020-06-03 21:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:31:15] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2020-06-03 21:31:15] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-06-03 21:31:15] [INFO ] [Real]Added 128 Read/Feed constraints in 25 ms returned sat
[2020-06-03 21:31:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:31:15] [INFO ] [Nat]Absence check using 82 positive place invariants in 24 ms returned sat
[2020-06-03 21:31:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:31:15] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2020-06-03 21:31:15] [INFO ] [Nat]Added 128 Read/Feed constraints in 22 ms returned sat
[2020-06-03 21:31:15] [INFO ] Deduced a trap composed of 54 places in 87 ms
[2020-06-03 21:31:15] [INFO ] Deduced a trap composed of 9 places in 77 ms
[2020-06-03 21:31:15] [INFO ] Deduced a trap composed of 9 places in 95 ms
[2020-06-03 21:31:15] [INFO ] Deduced a trap composed of 9 places in 84 ms
[2020-06-03 21:31:15] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2020-06-03 21:31:16] [INFO ] Deduced a trap composed of 17 places in 90 ms
[2020-06-03 21:31:16] [INFO ] Deduced a trap composed of 51 places in 82 ms
[2020-06-03 21:31:16] [INFO ] Deduced a trap composed of 54 places in 88 ms
[2020-06-03 21:31:16] [INFO ] Deduced a trap composed of 66 places in 85 ms
[2020-06-03 21:31:16] [INFO ] Deduced a trap composed of 64 places in 100 ms
[2020-06-03 21:31:16] [INFO ] Deduced a trap composed of 46 places in 87 ms
[2020-06-03 21:31:16] [INFO ] Deduced a trap composed of 50 places in 97 ms
[2020-06-03 21:31:16] [INFO ] Deduced a trap composed of 33 places in 75 ms
[2020-06-03 21:31:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1334 ms
[2020-06-03 21:31:16] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 28 ms.
[2020-06-03 21:31:20] [INFO ] Added : 376 causal constraints over 76 iterations in 3485 ms. Result :sat
[2020-06-03 21:31:20] [INFO ] Deduced a trap composed of 38 places in 96 ms
[2020-06-03 21:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
Attempting to minimize the solution found.
Minimization took 50 ms.
Incomplete Parikh walk after 182300 steps, including 1000 resets, run finished after 358 ms. (steps per millisecond=509 ) properties seen :[0] could not realise parikh vector
Support contains 24 out of 266 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 24 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 584/584 transitions.
Starting structural reductions, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 20 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2020-06-03 21:31:20] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 21:31:20] [INFO ] Computed 82 place invariants in 2 ms
[2020-06-03 21:31:21] [INFO ] Implicit Places using invariants in 392 ms returned []
[2020-06-03 21:31:21] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 21:31:21] [INFO ] Computed 82 place invariants in 4 ms
[2020-06-03 21:31:21] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-06-03 21:31:22] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1599 ms to find 0 implicit places.
[2020-06-03 21:31:22] [INFO ] Redundant transitions in 35 ms returned []
[2020-06-03 21:31:22] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 21:31:22] [INFO ] Computed 82 place invariants in 8 ms
[2020-06-03 21:31:23] [INFO ] Dead Transitions using invariants and state equation in 495 ms returned []
Finished structural reductions, in 1 iterations. Remains : 266/266 places, 584/584 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 230 ms. (steps per millisecond=434 ) properties seen :[0]
[2020-06-03 21:31:23] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2020-06-03 21:31:23] [INFO ] Computed 82 place invariants in 1 ms
[2020-06-03 21:31:23] [INFO ] [Real]Absence check using 82 positive place invariants in 23 ms returned sat
[2020-06-03 21:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:31:23] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2020-06-03 21:31:23] [INFO ] State equation strengthened by 128 read => feed constraints.
[2020-06-03 21:31:23] [INFO ] [Real]Added 128 Read/Feed constraints in 29 ms returned sat
[2020-06-03 21:31:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:31:23] [INFO ] [Nat]Absence check using 82 positive place invariants in 24 ms returned sat
[2020-06-03 21:31:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:31:23] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2020-06-03 21:31:23] [INFO ] [Nat]Added 128 Read/Feed constraints in 17 ms returned sat
[2020-06-03 21:31:24] [INFO ] Deduced a trap composed of 54 places in 96 ms
[2020-06-03 21:31:24] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2020-06-03 21:31:24] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2020-06-03 21:31:24] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2020-06-03 21:31:24] [INFO ] Deduced a trap composed of 9 places in 95 ms
[2020-06-03 21:31:24] [INFO ] Deduced a trap composed of 17 places in 88 ms
[2020-06-03 21:31:24] [INFO ] Deduced a trap composed of 51 places in 87 ms
[2020-06-03 21:31:24] [INFO ] Deduced a trap composed of 54 places in 87 ms
[2020-06-03 21:31:24] [INFO ] Deduced a trap composed of 66 places in 89 ms
[2020-06-03 21:31:24] [INFO ] Deduced a trap composed of 64 places in 86 ms
[2020-06-03 21:31:25] [INFO ] Deduced a trap composed of 46 places in 84 ms
[2020-06-03 21:31:25] [INFO ] Deduced a trap composed of 50 places in 87 ms
[2020-06-03 21:31:25] [INFO ] Deduced a trap composed of 33 places in 102 ms
[2020-06-03 21:31:25] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1366 ms
[2020-06-03 21:31:25] [INFO ] Computed and/alt/rep : 576/5248/408 causal constraints in 24 ms.
[2020-06-03 21:31:28] [INFO ] Added : 376 causal constraints over 76 iterations in 3589 ms. Result :sat
[2020-06-03 21:31:29] [INFO ] Deduced a trap composed of 38 places in 85 ms
[2020-06-03 21:31:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
Graph (trivial) has 248 edges and 266 vertex of which 40 / 266 are part of one of the 8 SCC in 12 ms
Free SCC test removed 32 places
Discarding 9 places :
Also discarding 0 output transitions
Graph (complete) has 632 edges and 234 vertex of which 225 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.14 ms
Drop transitions removed 160 transitions
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 272 transitions.
Iterating post reduction 0 with 272 rules applied. Total rules applied 274 place count 225 transition count 312
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 274 place count 225 transition count 248
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 64 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 1 with 192 rules applied. Total rules applied 466 place count 97 transition count 248
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 474 place count 97 transition count 240
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 482 place count 89 transition count 240
Partial Post-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 490 place count 89 transition count 240
Applied a total of 490 rules in 71 ms. Remains 89 /266 variables (removed 177) and now considering 240/584 (removed 344) transitions.
// Phase 1: matrix 240 rows 89 cols
[2020-06-03 21:31:29] [INFO ] Computed 17 place invariants in 1 ms
[2020-06-03 21:31:29] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2020-06-03 21:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:31:29] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2020-06-03 21:31:29] [INFO ] Computed and/alt/rep : 216/1472/216 causal constraints in 13 ms.
[2020-06-03 21:31:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:31:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2020-06-03 21:31:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:31:29] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2020-06-03 21:31:29] [INFO ] Computed and/alt/rep : 216/1472/216 causal constraints in 13 ms.
[2020-06-03 21:31:29] [INFO ] Added : 113 causal constraints over 23 iterations in 351 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-06-03 21:31:29] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2020-06-03 21:31:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 28 ms.
[2020-06-03 21:31:30] [INFO ] Flatten gal took : 107 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ LamportFastMutEx-PT-8 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ LamportFastMutEx-PT-8

{
"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 21:31:30 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 21068,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "A (G (((p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 1 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257) OR (p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 <= 1) OR (p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 <= 2))))",
"processed_size": 248,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 2560,
"conflict_clusters": 11,
"places": 266,
"places_significant": 184,
"singleton_clusters": 0,
"transitions": 584
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"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: 850/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 266
lola: finding significant places
lola: 266 places, 584 transitions, 184 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: A (G (((p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 1 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257) OR (p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 <= 1) OR (p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 <= 2))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + 1 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257) OR (p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 <= 1) OR (p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 <= 2))))
lola: processed formula length: 248
lola: 2 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: state equation task get result started, id 0
lola: local time limit reached - aborting
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 <= p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169) AND (2 <= p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82) AND (3 <= p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: memory consumption: 21068 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
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-PT-8"
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-PT-8, 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-158987928900694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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