Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428500307.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is LamportFastMutEx-COL-5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428500307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 41K May 5 16:51 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-5-ReachabilityCardinality-00
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-01
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-02
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-03
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-04
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-05
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-06
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-07
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-08
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-09
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-10
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-11
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-12
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-13
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-14
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620929181377

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:06:22] [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]
[2021-05-13 18:06:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:06:22] [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.
[2021-05-13 18:06:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 572 ms
[2021-05-13 18:06:23] [INFO ] sort/places :
pid * pid->P-wait,P-done,
pid * bool->P-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,

[2021-05-13 18:06:23] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 24 ms.
[2021-05-13 18:06:23] [INFO ] Computed order based on color domains.
[2021-05-13 18:06:23] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions in 14 ms.
[2021-05-13 18:06:23] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 58 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 69 ms. (steps per millisecond=144 ) properties seen :[0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1]
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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]
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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 1]
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-13 18:06:23] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2021-05-13 18:06:23] [INFO ] Computed 37 place invariants in 7 ms
[2021-05-13 18:06:23] [INFO ] [Real]Absence check using 37 positive place invariants in 21 ms returned sat
[2021-05-13 18:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:23] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-13 18:06:23] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-13 18:06:23] [INFO ] [Real]Added 65 Read/Feed constraints in 11 ms returned sat
[2021-05-13 18:06:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:06:23] [INFO ] [Nat]Absence check using 37 positive place invariants in 20 ms returned sat
[2021-05-13 18:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:24] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-13 18:06:24] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2021-05-13 18:06:24] [INFO ] Deduced a trap composed of 36 places in 71 ms
[2021-05-13 18:06:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2021-05-13 18:06:24] [INFO ] Computed and/alt/rep : 255/1495/195 causal constraints in 16 ms.
[2021-05-13 18:06:24] [INFO ] Added : 141 causal constraints over 29 iterations in 459 ms. Result :sat
[2021-05-13 18:06:24] [INFO ] Deduced a trap composed of 14 places in 42 ms
[2021-05-13 18:06:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-13 18:06:24] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned unsat
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 32600 steps, including 949 resets, run finished after 130 ms. (steps per millisecond=250 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 15 place count 132 transition count 250
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 20 place count 127 transition count 250
Applied a total of 20 rules in 36 ms. Remains 127 /137 variables (removed 10) and now considering 250/260 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/137 places, 250/260 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2409 ms. (steps per millisecond=415 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties seen :[0]
Interrupted probabilistic random walk after 16109256 steps, run timeout after 30001 ms. (steps per millisecond=536 ) properties seen :[0]
Probabilistic random walk after 16109256 steps, saw 2875855 distinct states, run finished after 30001 ms. (steps per millisecond=536 ) properties seen :[0]
[2021-05-13 18:06:58] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2021-05-13 18:06:58] [INFO ] Computed 37 place invariants in 3 ms
[2021-05-13 18:06:58] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2021-05-13 18:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:58] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-13 18:06:58] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-13 18:06:58] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2021-05-13 18:06:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:06:58] [INFO ] [Nat]Absence check using 37 positive place invariants in 16 ms returned sat
[2021-05-13 18:06:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:06:58] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2021-05-13 18:06:58] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2021-05-13 18:06:58] [INFO ] Deduced a trap composed of 7 places in 60 ms
[2021-05-13 18:06:58] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2021-05-13 18:06:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2021-05-13 18:06:58] [INFO ] Computed and/alt/rep : 245/1685/185 causal constraints in 14 ms.
[2021-05-13 18:06:58] [INFO ] Added : 130 causal constraints over 26 iterations in 341 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 26000 steps, including 916 resets, run finished after 78 ms. (steps per millisecond=333 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 250/250 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2021-05-13 18:06:58] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2021-05-13 18:06:58] [INFO ] Computed 37 place invariants in 2 ms
[2021-05-13 18:06:58] [INFO ] Implicit Places using invariants in 119 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 121 ms to find 5 implicit places.
[2021-05-13 18:06:59] [INFO ] Redundant transitions in 9 ms returned []
[2021-05-13 18:06:59] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2021-05-13 18:06:59] [INFO ] Computed 32 place invariants in 2 ms
[2021-05-13 18:06:59] [INFO ] Dead Transitions using invariants and state equation in 164 ms returned []
Starting structural reductions, iteration 1 : 122/127 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2021-05-13 18:06:59] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-13 18:06:59] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2021-05-13 18:06:59] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-13 18:06:59] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
Finished structural reductions, in 2 iterations. Remains : 122/127 places, 250/250 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2318 ms. (steps per millisecond=431 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 727 ms. (steps per millisecond=1375 ) properties seen :[0]
Interrupted probabilistic random walk after 16689064 steps, run timeout after 30001 ms. (steps per millisecond=556 ) properties seen :[0]
Probabilistic random walk after 16689064 steps, saw 2975691 distinct states, run finished after 30001 ms. (steps per millisecond=556 ) properties seen :[0]
[2021-05-13 18:07:32] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2021-05-13 18:07:32] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-13 18:07:32] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2021-05-13 18:07:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:07:32] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-13 18:07:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-13 18:07:32] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:07:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:07:32] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2021-05-13 18:07:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:07:32] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-13 18:07:32] [INFO ] [Nat]Added 40 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:07:32] [INFO ] Deduced a trap composed of 7 places in 70 ms
[2021-05-13 18:07:32] [INFO ] Deduced a trap composed of 27 places in 46 ms
[2021-05-13 18:07:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2021-05-13 18:07:32] [INFO ] Computed and/alt/rep : 245/1575/185 causal constraints in 13 ms.
[2021-05-13 18:07:33] [INFO ] Added : 175 causal constraints over 35 iterations in 521 ms. Result :sat
[2021-05-13 18:07:33] [INFO ] Deduced a trap composed of 10 places in 41 ms
[2021-05-13 18:07:33] [INFO ] Deduced a trap composed of 9 places in 42 ms
[2021-05-13 18:07:33] [INFO ] Deduced a trap composed of 7 places in 11 ms
[2021-05-13 18:07:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 155 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 43900 steps, including 941 resets, run finished after 121 ms. (steps per millisecond=362 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2021-05-13 18:07:33] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2021-05-13 18:07:33] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-13 18:07:33] [INFO ] Implicit Places using invariants in 105 ms returned []
[2021-05-13 18:07:33] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2021-05-13 18:07:33] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-13 18:07:33] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-13 18:07:34] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2021-05-13 18:07:34] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-13 18:07:34] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2021-05-13 18:07:34] [INFO ] Computed 32 place invariants in 1 ms
[2021-05-13 18:07:34] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 230 ms. (steps per millisecond=434 ) properties seen :[0]
[2021-05-13 18:07:34] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2021-05-13 18:07:34] [INFO ] Computed 32 place invariants in 0 ms
[2021-05-13 18:07:34] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-13 18:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:07:34] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-13 18:07:34] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-13 18:07:34] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:07:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:07:34] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2021-05-13 18:07:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:07:34] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-13 18:07:34] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:07:34] [INFO ] Deduced a trap composed of 7 places in 69 ms
[2021-05-13 18:07:34] [INFO ] Deduced a trap composed of 27 places in 47 ms
[2021-05-13 18:07:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2021-05-13 18:07:34] [INFO ] Computed and/alt/rep : 245/1575/185 causal constraints in 13 ms.
[2021-05-13 18:07:35] [INFO ] Added : 175 causal constraints over 35 iterations in 508 ms. Result :sat
[2021-05-13 18:07:35] [INFO ] Deduced a trap composed of 10 places in 44 ms
[2021-05-13 18:07:35] [INFO ] Deduced a trap composed of 9 places in 42 ms
[2021-05-13 18:07:35] [INFO ] Deduced a trap composed of 7 places in 12 ms
[2021-05-13 18:07:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 159 ms
Graph (trivial) has 110 edges and 122 vertex of which 25 / 122 are part of one of the 5 SCC in 10 ms
Free SCC test removed 20 places
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 310 edges and 102 vertex of which 96 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Drop transitions removed 70 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 96 transition count 140
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 112 place count 96 transition count 115
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 1 with 70 rules applied. Total rules applied 182 place count 51 transition count 115
Graph (trivial) has 30 edges and 51 vertex of which 25 / 51 are part of one of the 5 SCC in 1 ms
Free SCC test removed 20 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 183 place count 31 transition count 115
Drop transitions removed 25 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 218 place count 31 transition count 80
Applied a total of 218 rules in 30 ms. Remains 31 /122 variables (removed 91) and now considering 80/250 (removed 170) transitions.
// Phase 1: matrix 80 rows 31 cols
[2021-05-13 18:07:35] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-13 18:07:35] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-13 18:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:07:35] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-13 18:07:35] [INFO ] Computed and/alt/rep : 65/325/65 causal constraints in 4 ms.
[2021-05-13 18:07:35] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 18:07:35] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2021-05-13 18:07:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
[2021-05-13 18:07:35] [INFO ] Flatten gal took : 49 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ LamportFastMutEx-COL-5 @ 3570 seconds
vrfy: finished
info: timeLeft: 3568
rslt: Output for ReachabilityCardinality @ LamportFastMutEx-COL-5

{
"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": "Thu May 13 18:07:36 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 19608,
"runtime": 2.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": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G ((p112 + p113 + p114 + p115 + p116 <= 1)))",
"processed_size": 47,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 1160,
"conflict_clusters": 7,
"places": 122,
"places_significant": 90,
"singleton_clusters": 0,
"transitions": 250
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"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: 372/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 122
lola: finding significant places
lola: 122 places, 250 transitions, 90 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 ((p112 + p113 + p114 + p115 + p116 <= 1)))
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 ((p112 + p113 + p114 + p115 + p116 <= 1)))
lola: processed formula length: 47
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: 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: local time limit reached - aborting
lola: formula 0: (2 <= p112 + p113 + p114 + p115 + p116)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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.
lola: memory consumption: 19608 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-5"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is LamportFastMutEx-COL-5, 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 r132-tall-162075428500307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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