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-158987928800623.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928800623
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-01
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-02
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-03
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-04
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-05
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-06
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-07
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-08
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-09
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-10
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-11
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-12
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-13
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-14
FORMULA_NAME LamportFastMutEx-COL-6-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591216325314

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:32:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:32:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:32:07] [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:32:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 543 ms
[2020-06-03 20:32:07] [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:32:07] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 71 ms.
[2020-06-03 20:32:07] [INFO ] Computed order based on color domains.
[2020-06-03 20:32:07] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions in 16 ms.
[2020-06-03 20:32:07] [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/ReachabilityFireability.xml in 69 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 133 ms. (steps per millisecond=75 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1]
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 78 ms. (steps per millisecond=128 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=107 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0]
[2020-06-03 20:32:08] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2020-06-03 20:32:08] [INFO ] Computed 50 place invariants in 8 ms
[2020-06-03 20:32:08] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned unsat
[2020-06-03 20:32:08] [INFO ] [Real]Absence check using 50 positive place invariants in 32 ms returned sat
[2020-06-03 20:32:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:32:08] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2020-06-03 20:32:08] [INFO ] State equation strengthened by 84 read => feed constraints.
[2020-06-03 20:32:08] [INFO ] [Real]Added 84 Read/Feed constraints in 16 ms returned sat
[2020-06-03 20:32:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:32:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2020-06-03 20:32:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:32:09] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2020-06-03 20:32:09] [INFO ] [Nat]Added 84 Read/Feed constraints in 18 ms returned sat
[2020-06-03 20:32:09] [INFO ] Deduced a trap composed of 33 places in 233 ms
[2020-06-03 20:32:09] [INFO ] Deduced a trap composed of 25 places in 141 ms
[2020-06-03 20:32:09] [INFO ] Deduced a trap composed of 18 places in 106 ms
[2020-06-03 20:32:09] [INFO ] Deduced a trap composed of 21 places in 56 ms
[2020-06-03 20:32:09] [INFO ] Deduced a trap composed of 9 places in 28 ms
[2020-06-03 20:32:09] [INFO ] Deduced a trap composed of 9 places in 27 ms
[2020-06-03 20:32:09] [INFO ] Deduced a trap composed of 19 places in 45 ms
[2020-06-03 20:32:10] [INFO ] Deduced a trap composed of 23 places in 67 ms
[2020-06-03 20:32:10] [INFO ] Deduced a trap composed of 25 places in 59 ms
[2020-06-03 20:32:10] [INFO ] Deduced a trap composed of 17 places in 113 ms
[2020-06-03 20:32:10] [INFO ] Deduced a trap composed of 16 places in 111 ms
[2020-06-03 20:32:10] [INFO ] Deduced a trap composed of 9 places in 138 ms
[2020-06-03 20:32:10] [INFO ] Deduced a trap composed of 32 places in 181 ms
[2020-06-03 20:32:10] [INFO ] Deduced a trap composed of 28 places in 105 ms
[2020-06-03 20:32:11] [INFO ] Deduced a trap composed of 27 places in 148 ms
[2020-06-03 20:32:11] [INFO ] Deduced a trap composed of 9 places in 110 ms
[2020-06-03 20:32:11] [INFO ] Deduced a trap composed of 15 places in 66 ms
[2020-06-03 20:32:11] [INFO ] Deduced a trap composed of 8 places in 96 ms
[2020-06-03 20:32:11] [INFO ] Deduced a trap composed of 33 places in 103 ms
[2020-06-03 20:32:11] [INFO ] Deduced a trap composed of 25 places in 100 ms
[2020-06-03 20:32:11] [INFO ] Deduced a trap composed of 29 places in 261 ms
[2020-06-03 20:32:11] [INFO ] Deduced a trap composed of 29 places in 65 ms
[2020-06-03 20:32:12] [INFO ] Deduced a trap composed of 21 places in 134 ms
[2020-06-03 20:32:12] [INFO ] Deduced a trap composed of 18 places in 121 ms
[2020-06-03 20:32:12] [INFO ] Deduced a trap composed of 18 places in 170 ms
[2020-06-03 20:32:12] [INFO ] Deduced a trap composed of 15 places in 65 ms
[2020-06-03 20:32:12] [INFO ] Deduced a trap composed of 25 places in 62 ms
[2020-06-03 20:32:12] [INFO ] Deduced a trap composed of 18 places in 48 ms
[2020-06-03 20:32:12] [INFO ] Deduced a trap composed of 18 places in 50 ms
[2020-06-03 20:32:12] [INFO ] Deduced a trap composed of 24 places in 41 ms
[2020-06-03 20:32:12] [INFO ] Deduced a trap composed of 14 places in 45 ms
[2020-06-03 20:32:12] [INFO ] Deduced a trap composed of 20 places in 46 ms
[2020-06-03 20:32:12] [INFO ] Deduced a trap composed of 23 places in 67 ms
[2020-06-03 20:32:13] [INFO ] Deduced a trap composed of 18 places in 230 ms
[2020-06-03 20:32:13] [INFO ] Deduced a trap composed of 32 places in 50 ms
[2020-06-03 20:32:13] [INFO ] Deduced a trap composed of 28 places in 131 ms
[2020-06-03 20:32:13] [INFO ] Deduced a trap composed of 21 places in 55 ms
[2020-06-03 20:32:13] [INFO ] Deduced a trap composed of 17 places in 57 ms
[2020-06-03 20:32:13] [INFO ] Deduced a trap composed of 9 places in 63 ms
[2020-06-03 20:32:13] [INFO ] Deduced a trap composed of 9 places in 115 ms
[2020-06-03 20:32:13] [INFO ] Deduced a trap composed of 27 places in 121 ms
[2020-06-03 20:32:13] [INFO ] Deduced a trap composed of 21 places in 104 ms
[2020-06-03 20:32:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1 s13 s14 s15 s16 s17 s19 s20 s23 s32 s38 s44 s60 s66 s69 s72 s98 s111 s153 s159 s168) 0)") while checking expression at index 1
[2020-06-03 20:32:14] [INFO ] [Real]Absence check using 50 positive place invariants in 34 ms returned sat
[2020-06-03 20:32:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:32:14] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2020-06-03 20:32:14] [INFO ] [Real]Added 84 Read/Feed constraints in 11 ms returned sat
[2020-06-03 20:32:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:32:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 18 ms returned sat
[2020-06-03 20:32:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:32:14] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2020-06-03 20:32:14] [INFO ] [Nat]Added 84 Read/Feed constraints in 11 ms returned sat
[2020-06-03 20:32:14] [INFO ] Computed and/alt/rep : 348/2412/258 causal constraints in 21 ms.
[2020-06-03 20:32:15] [INFO ] Added : 240 causal constraints over 48 iterations in 1306 ms. Result :sat
[2020-06-03 20:32:15] [INFO ] Deduced a trap composed of 9 places in 132 ms
[2020-06-03 20:32:16] [INFO ] Deduced a trap composed of 17 places in 123 ms
[2020-06-03 20:32:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
Attempting to minimize the solution found.
Minimization took 33 ms.
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 78200 steps, including 1000 resets, run finished after 486 ms. (steps per millisecond=160 ) properties seen :[0, 0] could not realise parikh vector
Support contains 104 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 20 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 5294 ms. (steps per millisecond=188 ) properties seen :[0, 0]
Interrupted Best-First random walk after 563110 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3974 ms. (steps per millisecond=251 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 13198382 steps, run timeout after 30001 ms. (steps per millisecond=439 ) properties seen :[0, 0]
Probabilistic random walk after 13198382 steps, saw 2217922 distinct states, run finished after 30001 ms. (steps per millisecond=439 ) properties seen :[0, 0]
[2020-06-03 20:33:00] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2020-06-03 20:33:00] [INFO ] Computed 50 place invariants in 2 ms
[2020-06-03 20:33:00] [INFO ] [Real]Absence check using 50 positive place invariants in 34 ms returned sat
[2020-06-03 20:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:33:01] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2020-06-03 20:33:01] [INFO ] State equation strengthened by 84 read => feed constraints.
[2020-06-03 20:33:01] [INFO ] [Real]Added 84 Read/Feed constraints in 10 ms returned sat
[2020-06-03 20:33:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:33:01] [INFO ] [Nat]Absence check using 50 positive place invariants in 20 ms returned sat
[2020-06-03 20:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:33:01] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2020-06-03 20:33:01] [INFO ] [Nat]Added 84 Read/Feed constraints in 29 ms returned sat
[2020-06-03 20:33:01] [INFO ] Deduced a trap composed of 33 places in 148 ms
[2020-06-03 20:33:01] [INFO ] Deduced a trap composed of 25 places in 97 ms
[2020-06-03 20:33:01] [INFO ] Deduced a trap composed of 18 places in 46 ms
[2020-06-03 20:33:01] [INFO ] Deduced a trap composed of 21 places in 59 ms
[2020-06-03 20:33:01] [INFO ] Deduced a trap composed of 9 places in 55 ms
[2020-06-03 20:33:01] [INFO ] Deduced a trap composed of 9 places in 9 ms
[2020-06-03 20:33:01] [INFO ] Deduced a trap composed of 19 places in 49 ms
[2020-06-03 20:33:02] [INFO ] Deduced a trap composed of 23 places in 142 ms
[2020-06-03 20:33:02] [INFO ] Deduced a trap composed of 25 places in 61 ms
[2020-06-03 20:33:02] [INFO ] Deduced a trap composed of 17 places in 55 ms
[2020-06-03 20:33:02] [INFO ] Deduced a trap composed of 16 places in 60 ms
[2020-06-03 20:33:02] [INFO ] Deduced a trap composed of 9 places in 67 ms
[2020-06-03 20:33:02] [INFO ] Deduced a trap composed of 32 places in 55 ms
[2020-06-03 20:33:02] [INFO ] Deduced a trap composed of 28 places in 59 ms
[2020-06-03 20:33:02] [INFO ] Deduced a trap composed of 27 places in 62 ms
[2020-06-03 20:33:02] [INFO ] Deduced a trap composed of 9 places in 54 ms
[2020-06-03 20:33:02] [INFO ] Deduced a trap composed of 15 places in 52 ms
[2020-06-03 20:33:02] [INFO ] Deduced a trap composed of 8 places in 60 ms
[2020-06-03 20:33:02] [INFO ] Deduced a trap composed of 33 places in 56 ms
[2020-06-03 20:33:02] [INFO ] Deduced a trap composed of 25 places in 63 ms
[2020-06-03 20:33:02] [INFO ] Deduced a trap composed of 29 places in 60 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 29 places in 42 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 21 places in 51 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 18 places in 73 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 18 places in 67 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 15 places in 50 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 25 places in 51 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 18 places in 72 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 18 places in 51 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 24 places in 40 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 14 places in 62 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 20 places in 47 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 23 places in 43 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 18 places in 47 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 32 places in 65 ms
[2020-06-03 20:33:03] [INFO ] Deduced a trap composed of 28 places in 53 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 21 places in 44 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 17 places in 66 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 9 places in 54 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 9 places in 54 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 27 places in 69 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 21 places in 43 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 16 places in 42 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 10 places in 54 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 21 places in 54 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 28 places in 54 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 9 places in 49 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 20 places in 40 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 23 places in 49 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 24 places in 61 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 15 places in 34 ms
[2020-06-03 20:33:04] [INFO ] Deduced a trap composed of 19 places in 47 ms
[2020-06-03 20:33:05] [INFO ] Deduced a trap composed of 20 places in 53 ms
[2020-06-03 20:33:05] [INFO ] Deduced a trap composed of 23 places in 66 ms
[2020-06-03 20:33:05] [INFO ] Deduced a trap composed of 18 places in 51 ms
[2020-06-03 20:33:05] [INFO ] Deduced a trap composed of 9 places in 53 ms
[2020-06-03 20:33:05] [INFO ] Deduced a trap composed of 29 places in 52 ms
[2020-06-03 20:33:05] [INFO ] Deduced a trap composed of 15 places in 56 ms
[2020-06-03 20:33:05] [INFO ] Deduced a trap composed of 25 places in 79 ms
[2020-06-03 20:33:05] [INFO ] Deduced a trap composed of 16 places in 54 ms
[2020-06-03 20:33:05] [INFO ] Deduced a trap composed of 8 places in 87 ms
[2020-06-03 20:33:05] [INFO ] Deduced a trap composed of 24 places in 46 ms
[2020-06-03 20:33:05] [INFO ] Deduced a trap composed of 29 places in 46 ms
[2020-06-03 20:33:05] [INFO ] Deduced a trap composed of 26 places in 48 ms
[2020-06-03 20:33:05] [INFO ] Deduced a trap composed of 15 places in 38 ms
[2020-06-03 20:33:05] [INFO ] Deduced a trap composed of 15 places in 67 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 17 places in 75 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 16 places in 43 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 19 places in 34 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 16 places in 51 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 9 places in 53 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 30 places in 49 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 22 places in 70 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 36 places in 45 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 35 places in 42 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 24 places in 41 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 22 places in 55 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 16 places in 38 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 22 places in 40 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 23 places in 39 ms
[2020-06-03 20:33:06] [INFO ] Deduced a trap composed of 25 places in 57 ms
[2020-06-03 20:33:07] [INFO ] Deduced a trap composed of 26 places in 48 ms
[2020-06-03 20:33:07] [INFO ] Deduced a trap composed of 23 places in 81 ms
[2020-06-03 20:33:07] [INFO ] Deduced a trap composed of 9 places in 45 ms
[2020-06-03 20:33:07] [INFO ] Deduced a trap composed of 15 places in 56 ms
[2020-06-03 20:33:07] [INFO ] Deduced a trap composed of 23 places in 73 ms
[2020-06-03 20:33:07] [INFO ] Deduced a trap composed of 37 places in 53 ms
[2020-06-03 20:33:07] [INFO ] Deduced a trap composed of 16 places in 46 ms
[2020-06-03 20:33:07] [INFO ] Deduced a trap composed of 15 places in 44 ms
[2020-06-03 20:33:07] [INFO ] Deduced a trap composed of 30 places in 52 ms
[2020-06-03 20:33:07] [INFO ] Deduced a trap composed of 35 places in 59 ms
[2020-06-03 20:33:07] [INFO ] Deduced a trap composed of 27 places in 96 ms
[2020-06-03 20:33:07] [INFO ] Deduced a trap composed of 25 places in 55 ms
[2020-06-03 20:33:07] [INFO ] Deduced a trap composed of 17 places in 38 ms
[2020-06-03 20:33:07] [INFO ] Deduced a trap composed of 24 places in 54 ms
[2020-06-03 20:33:08] [INFO ] Deduced a trap composed of 21 places in 90 ms
[2020-06-03 20:33:08] [INFO ] Deduced a trap composed of 9 places in 53 ms
[2020-06-03 20:33:08] [INFO ] Deduced a trap composed of 37 places in 56 ms
[2020-06-03 20:33:08] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2020-06-03 20:33:08] [INFO ] Deduced a trap composed of 23 places in 52 ms
[2020-06-03 20:33:08] [INFO ] Deduced a trap composed of 27 places in 92 ms
[2020-06-03 20:33:08] [INFO ] Deduced a trap composed of 26 places in 57 ms
[2020-06-03 20:33:08] [INFO ] Deduced a trap composed of 16 places in 42 ms
[2020-06-03 20:33:08] [INFO ] Deduced a trap composed of 23 places in 48 ms
[2020-06-03 20:33:08] [INFO ] Deduced a trap composed of 16 places in 49 ms
[2020-06-03 20:33:08] [INFO ] Deduced a trap composed of 21 places in 56 ms
[2020-06-03 20:33:08] [INFO ] Deduced a trap composed of 34 places in 47 ms
[2020-06-03 20:33:08] [INFO ] Deduced a trap composed of 23 places in 56 ms
[2020-06-03 20:33:09] [INFO ] Deduced a trap composed of 16 places in 37 ms
[2020-06-03 20:33:09] [INFO ] Deduced a trap composed of 23 places in 53 ms
[2020-06-03 20:33:09] [INFO ] Deduced a trap composed of 15 places in 96 ms
[2020-06-03 20:33:09] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2020-06-03 20:33:09] [INFO ] Deduced a trap composed of 17 places in 47 ms
[2020-06-03 20:33:09] [INFO ] Deduced a trap composed of 25 places in 55 ms
[2020-06-03 20:33:09] [INFO ] Deduced a trap composed of 27 places in 54 ms
[2020-06-03 20:33:09] [INFO ] Deduced a trap composed of 21 places in 52 ms
[2020-06-03 20:33:09] [INFO ] Deduced a trap composed of 26 places in 51 ms
[2020-06-03 20:33:09] [INFO ] Deduced a trap composed of 29 places in 74 ms
[2020-06-03 20:33:09] [INFO ] Deduced a trap composed of 16 places in 50 ms
[2020-06-03 20:33:09] [INFO ] Deduced a trap composed of 18 places in 85 ms
[2020-06-03 20:33:09] [INFO ] Deduced a trap composed of 17 places in 67 ms
[2020-06-03 20:33:09] [INFO ] Deduced a trap composed of 16 places in 39 ms
[2020-06-03 20:33:10] [INFO ] Deduced a trap composed of 35 places in 106 ms
[2020-06-03 20:33:10] [INFO ] Deduced a trap composed of 24 places in 44 ms
[2020-06-03 20:33:10] [INFO ] Deduced a trap composed of 37 places in 54 ms
[2020-06-03 20:33:10] [INFO ] Deduced a trap composed of 31 places in 40 ms
[2020-06-03 20:33:10] [INFO ] Deduced a trap composed of 17 places in 76 ms
[2020-06-03 20:33:10] [INFO ] Deduced a trap composed of 25 places in 44 ms
[2020-06-03 20:33:10] [INFO ] Deduced a trap composed of 22 places in 47 ms
[2020-06-03 20:33:10] [INFO ] Deduced a trap composed of 28 places in 54 ms
[2020-06-03 20:33:10] [INFO ] Deduced a trap composed of 22 places in 68 ms
[2020-06-03 20:33:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 132 trap constraints in 9259 ms
[2020-06-03 20:33:10] [INFO ] [Real]Absence check using 50 positive place invariants in 21 ms returned sat
[2020-06-03 20:33:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:33:10] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2020-06-03 20:33:10] [INFO ] [Real]Added 84 Read/Feed constraints in 9 ms returned sat
[2020-06-03 20:33:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:33:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 17 ms returned sat
[2020-06-03 20:33:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:33:10] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2020-06-03 20:33:10] [INFO ] [Nat]Added 84 Read/Feed constraints in 10 ms returned sat
[2020-06-03 20:33:11] [INFO ] Computed and/alt/rep : 348/2412/258 causal constraints in 26 ms.
[2020-06-03 20:33:12] [INFO ] Added : 240 causal constraints over 48 iterations in 1258 ms. Result :sat
[2020-06-03 20:33:12] [INFO ] Deduced a trap composed of 9 places in 63 ms
[2020-06-03 20:33:12] [INFO ] Deduced a trap composed of 17 places in 34 ms
[2020-06-03 20:33:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 78200 steps, including 1000 resets, run finished after 244 ms. (steps per millisecond=320 ) properties seen :[0] could not realise parikh vector
Support contains 43 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 3019 ms. (steps per millisecond=331 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 3384 ms. (steps per millisecond=295 ) properties seen :[0]
Interrupted probabilistic random walk after 16656999 steps, run timeout after 30001 ms. (steps per millisecond=555 ) properties seen :[0]
Probabilistic random walk after 16656999 steps, saw 2778398 distinct states, run finished after 30001 ms. (steps per millisecond=555 ) properties seen :[0]
[2020-06-03 20:33:49] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2020-06-03 20:33:49] [INFO ] Computed 50 place invariants in 2 ms
[2020-06-03 20:33:49] [INFO ] [Real]Absence check using 50 positive place invariants in 31 ms returned sat
[2020-06-03 20:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:33:49] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2020-06-03 20:33:49] [INFO ] State equation strengthened by 84 read => feed constraints.
[2020-06-03 20:33:49] [INFO ] [Real]Added 84 Read/Feed constraints in 20 ms returned sat
[2020-06-03 20:33:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:33:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 24 ms returned sat
[2020-06-03 20:33:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:33:49] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2020-06-03 20:33:49] [INFO ] [Nat]Added 84 Read/Feed constraints in 11 ms returned sat
[2020-06-03 20:33:49] [INFO ] Computed and/alt/rep : 348/2412/258 causal constraints in 13 ms.
[2020-06-03 20:33:50] [INFO ] Added : 240 causal constraints over 48 iterations in 1308 ms. Result :sat
[2020-06-03 20:33:50] [INFO ] Deduced a trap composed of 9 places in 39 ms
[2020-06-03 20:33:50] [INFO ] Deduced a trap composed of 17 places in 33 ms
[2020-06-03 20:33:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
Incomplete Parikh walk after 78200 steps, including 1000 resets, run finished after 260 ms. (steps per millisecond=300 ) properties seen :[0] could not realise parikh vector
Support contains 43 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 13 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 7 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2020-06-03 20:33:51] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2020-06-03 20:33:51] [INFO ] Computed 50 place invariants in 1 ms
[2020-06-03 20:33:51] [INFO ] Implicit Places using invariants in 162 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 176 ms to find 6 implicit places.
[2020-06-03 20:33:51] [INFO ] Redundant transitions in 10 ms returned []
[2020-06-03 20:33:51] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2020-06-03 20:33:51] [INFO ] Computed 44 place invariants in 1 ms
[2020-06-03 20:33:51] [INFO ] Dead Transitions using invariants and state equation in 249 ms returned []
Starting structural reductions, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2020-06-03 20:33:51] [INFO ] Redundant transitions in 4 ms returned []
[2020-06-03 20:33:51] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2020-06-03 20:33:51] [INFO ] Computed 44 place invariants in 1 ms
[2020-06-03 20:33:51] [INFO ] Dead Transitions using invariants and state equation in 246 ms returned []
Finished structural reductions, in 2 iterations. Remains : 170/176 places, 354/354 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2970 ms. (steps per millisecond=336 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3382 ms. (steps per millisecond=295 ) properties seen :[0]
Interrupted probabilistic random walk after 16897165 steps, run timeout after 30001 ms. (steps per millisecond=563 ) properties seen :[0]
Probabilistic random walk after 16897165 steps, saw 2816866 distinct states, run finished after 30001 ms. (steps per millisecond=563 ) properties seen :[0]
[2020-06-03 20:34:28] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2020-06-03 20:34:28] [INFO ] Computed 44 place invariants in 1 ms
[2020-06-03 20:34:28] [INFO ] [Real]Absence check using 44 positive place invariants in 20 ms returned sat
[2020-06-03 20:34:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:34:28] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2020-06-03 20:34:28] [INFO ] State equation strengthened by 48 read => feed constraints.
[2020-06-03 20:34:28] [INFO ] [Real]Added 48 Read/Feed constraints in 10 ms returned sat
[2020-06-03 20:34:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:34:28] [INFO ] [Nat]Absence check using 44 positive place invariants in 17 ms returned sat
[2020-06-03 20:34:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:34:28] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2020-06-03 20:34:28] [INFO ] [Nat]Added 48 Read/Feed constraints in 29 ms returned sat
[2020-06-03 20:34:28] [INFO ] Deduced a trap composed of 33 places in 44 ms
[2020-06-03 20:34:28] [INFO ] Deduced a trap composed of 27 places in 58 ms
[2020-06-03 20:34:28] [INFO ] Deduced a trap composed of 18 places in 74 ms
[2020-06-03 20:34:28] [INFO ] Deduced a trap composed of 12 places in 52 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 9 places in 75 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 15 places in 68 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 9 places in 55 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 16 places in 46 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 15 places in 62 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 31 places in 35 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 17 places in 37 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 25 places in 48 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 16 places in 45 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 9 places in 31 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 24 places in 62 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 21 places in 43 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 19 places in 41 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 17 places in 57 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 24 places in 44 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 9 places in 40 ms
[2020-06-03 20:34:29] [INFO ] Deduced a trap composed of 21 places in 57 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 17 places in 57 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 15 places in 50 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 9 places in 18 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 17 places in 62 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 9 places in 23 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 16 places in 49 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 28 places in 68 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 21 places in 58 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 24 places in 57 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 26 places in 54 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 23 places in 54 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 18 places in 81 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 15 places in 52 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 16 places in 50 ms
[2020-06-03 20:34:30] [INFO ] Deduced a trap composed of 9 places in 50 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 21 places in 39 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 18 places in 48 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 20 places in 42 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 16 places in 51 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 17 places in 60 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 20 places in 58 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 16 places in 56 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 9 places in 41 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 41 places in 49 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 31 places in 50 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 23 places in 49 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 23 places in 60 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 22 places in 50 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 37 places in 56 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 15 places in 44 ms
[2020-06-03 20:34:31] [INFO ] Deduced a trap composed of 30 places in 58 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 19 places in 46 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 35 places in 47 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 20 places in 49 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 37 places in 56 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 16 places in 39 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 28 places in 50 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 37 places in 52 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 18 places in 45 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 19 places in 52 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 17 places in 51 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 20 places in 43 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 19 places in 49 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 16 places in 65 ms
[2020-06-03 20:34:32] [INFO ] Deduced a trap composed of 31 places in 80 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 16 places in 67 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 30 places in 45 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 21 places in 56 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 31 places in 43 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 20 places in 110 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 29 places in 44 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 16 places in 54 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 23 places in 70 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 23 places in 66 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 15 places in 42 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 20 places in 62 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 25 places in 58 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 17 places in 46 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 16 places in 55 ms
[2020-06-03 20:34:33] [INFO ] Deduced a trap composed of 15 places in 50 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 28 places in 54 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 16 places in 35 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 28 places in 53 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 25 places in 61 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 22 places in 44 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 9 places in 9 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 17 places in 37 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 23 places in 45 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 22 places in 48 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 24 places in 46 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 15 places in 31 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 29 places in 56 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 20 places in 52 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 15 places in 38 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 15 places in 47 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 18 places in 36 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 18 places in 49 ms
[2020-06-03 20:34:34] [INFO ] Deduced a trap composed of 10 places in 50 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 9 places in 43 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 19 places in 38 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 16 places in 42 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 25 places in 63 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 28 places in 50 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 22 places in 73 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 22 places in 50 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 16 places in 55 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 32 places in 53 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 16 places in 56 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 15 places in 50 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 9 places in 47 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 22 places in 49 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 18 places in 33 ms
[2020-06-03 20:34:35] [INFO ] Deduced a trap composed of 22 places in 40 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 22 places in 78 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 20 places in 37 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 25 places in 63 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 24 places in 62 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 27 places in 47 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 16 places in 40 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 36 places in 52 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 29 places in 51 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 20 places in 48 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 15 places in 63 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 17 places in 55 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 15 places in 58 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 29 places in 52 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2020-06-03 20:34:36] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2020-06-03 20:34:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 131 trap constraints in 8338 ms
FORMULA LamportFastMutEx-COL-6-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

--------------------
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="ReachabilityFireability"
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 ReachabilityFireability"
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-158987928800623"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;