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.r208-smll-162089471100111.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 gold2020
Input is SafeBus-COL-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-162089471100111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 11:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 11:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 42K 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 SafeBus-COL-06-ReachabilityCardinality-00
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-01
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-02
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-03
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-04
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-05
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-06
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-07
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-08
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-09
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-10
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-11
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-12
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-13
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-14
FORMULA_NAME SafeBus-COL-06-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621042511220

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-15 01:35:13] [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-15 01:35:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 01:35:14] [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-15 01:35:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 942 ms
[2021-05-15 01:35:15] [INFO ] sort/places :
Dom->AMC,wait_ack,
Dot->cable_free,ACK,T_out,R_tout,S_tout,FMCb,
It->Cpt2,Cpt1,msgl,cable_used,FMC,wait_cable,listen,RMC,PMC,MSG,wait_msg,loop_em,

[2021-05-15 01:35:15] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2021-05-15 01:35:15] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 60 ms.
[2021-05-15 01:35:15] [INFO ] Computed order based on color domains.
[2021-05-15 01:35:15] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions in 64 ms.
[2021-05-15 01:35:15] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 12 places and 12 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 132 ms.
Working with output stream class java.io.PrintStream
FORMULA SafeBus-COL-06-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 200 ms. (steps per millisecond=50 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1]
FORMULA SafeBus-COL-06-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-06-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-06-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-COL-06-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 66 ms. (steps per millisecond=151 ) properties seen :[0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA SafeBus-COL-06-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 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, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-15 01:35:15] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2021-05-15 01:35:15] [INFO ] Computed 29 place invariants in 22 ms
[2021-05-15 01:35:16] [INFO ] [Real]Absence check using 13 positive place invariants in 37 ms returned sat
[2021-05-15 01:35:16] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 23 ms returned unsat
[2021-05-15 01:35:16] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2021-05-15 01:35:16] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 11 ms returned sat
[2021-05-15 01:35:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:35:16] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2021-05-15 01:35:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-15 01:35:16] [INFO ] [Real]Added 43 Read/Feed constraints in 89 ms returned sat
[2021-05-15 01:35:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 01:35:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2021-05-15 01:35:16] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 11 ms returned sat
[2021-05-15 01:35:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 01:35:16] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2021-05-15 01:35:16] [INFO ] [Nat]Added 43 Read/Feed constraints in 27 ms returned sat
[2021-05-15 01:35:17] [INFO ] Deduced a trap composed of 13 places in 234 ms
[2021-05-15 01:35:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2021-05-15 01:35:17] [INFO ] Computed and/alt/rep : 445/6618/236 causal constraints in 62 ms.
[2021-05-15 01:35:21] [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: Broken pipe (=> (> t220 0) (and (or (and (> t158 0) (< o158 o220)) (and (> t164 0) (< o164 o220)) (and (> t170 0) (< o170 o220)) (and (> t176 0) (< o176 o220)) (and (> t182 0) (< o182 o220)) (and (> t188 0) (< o188 o220)) (and (> t207 0) (< o207 o220)) (and (> t213 0) (< o213 o220)) (and (> t219 0) (< o219 o220)) (and (> t225 0) (< o225 o220)) (and (> t231 0) (< o231 o220)) (and (> t237 0) (< o237 o220))) (and (> t202 0) (< o202 o220))))") while checking expression at index 1
[2021-05-15 01:35:21] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2021-05-15 01:35:21] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 12 ms returned unsat
[2021-05-15 01:35:21] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2021-05-15 01:35:21] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 6 ms returned unsat
[2021-05-15 01:35:21] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2021-05-15 01:35:21] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 11 ms returned sat
[2021-05-15 01:35:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:35:21] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-15 01:35:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 01:35:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned unsat
[2021-05-15 01:35:22] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2021-05-15 01:35:22] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned unsat
[2021-05-15 01:35:22] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2021-05-15 01:35:22] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 2 ms returned unsat
[2021-05-15 01:35:22] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2021-05-15 01:35:22] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 7 ms returned unsat
[2021-05-15 01:35:22] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2021-05-15 01:35:22] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 7 ms returned unsat
FORMULA SafeBus-COL-06-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SafeBus-COL-06-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SafeBus-COL-06-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SafeBus-COL-06-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SafeBus-COL-06-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SafeBus-COL-06-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SafeBus-COL-06-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SafeBus-COL-06-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 63 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 451/451 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3060 ms. (steps per millisecond=326 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1187 ms. (steps per millisecond=842 ) properties seen :[0]
Interrupted probabilistic random walk after 10872279 steps, run timeout after 30001 ms. (steps per millisecond=362 ) properties seen :[0]
Probabilistic random walk after 10872279 steps, saw 2249601 distinct states, run finished after 30002 ms. (steps per millisecond=362 ) properties seen :[0]
[2021-05-15 01:35:56] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2021-05-15 01:35:56] [INFO ] Computed 29 place invariants in 9 ms
[2021-05-15 01:35:56] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2021-05-15 01:35:56] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 6 ms returned sat
[2021-05-15 01:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:35:56] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2021-05-15 01:35:56] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-15 01:35:56] [INFO ] [Real]Added 43 Read/Feed constraints in 30 ms returned sat
[2021-05-15 01:35:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 01:35:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2021-05-15 01:35:56] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 11 ms returned sat
[2021-05-15 01:35:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 01:35:56] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2021-05-15 01:35:57] [INFO ] [Nat]Added 43 Read/Feed constraints in 22 ms returned sat
[2021-05-15 01:35:57] [INFO ] Deduced a trap composed of 13 places in 143 ms
[2021-05-15 01:35:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2021-05-15 01:35:57] [INFO ] Computed and/alt/rep : 445/6618/236 causal constraints in 43 ms.
[2021-05-15 01:36:04] [INFO ] Added : 230 causal constraints over 49 iterations in 7225 ms. Result :sat
[2021-05-15 01:36:04] [INFO ] Deduced a trap composed of 13 places in 186 ms
[2021-05-15 01:36:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
Attempting to minimize the solution found.
Minimization took 90 ms.
Incomplete Parikh walk after 40700 steps, including 982 resets, run finished after 177 ms. (steps per millisecond=229 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 31 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 24 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2021-05-15 01:36:05] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2021-05-15 01:36:05] [INFO ] Computed 29 place invariants in 6 ms
[2021-05-15 01:36:05] [INFO ] Implicit Places using invariants in 310 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 315 ms to find 6 implicit places.
[2021-05-15 01:36:05] [INFO ] Redundant transitions in 43 ms returned []
[2021-05-15 01:36:05] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 132 cols
[2021-05-15 01:36:05] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-15 01:36:06] [INFO ] Dead Transitions using invariants and state equation in 798 ms returned [31, 37, 43, 49, 55, 61, 68, 74, 80, 86, 92, 98, 105, 111, 117, 123, 129, 135, 142, 148, 154, 160, 166, 172, 179, 185, 191, 197, 203, 209, 216, 222, 228, 234, 240, 246]
Found 36 dead transitions using SMT.
Drop transitions removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions :[246, 240, 234, 228, 222, 216, 209, 203, 197, 191, 185, 179, 172, 166, 160, 154, 148, 142, 135, 129, 123, 117, 111, 105, 98, 92, 86, 80, 74, 68, 61, 55, 49, 43, 37, 31]
Starting structural reductions, iteration 1 : 132/138 places, 415/451 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 529
Applied a total of 12 rules in 83 ms. Remains 126 /132 variables (removed 6) and now considering 529/415 (removed -114) transitions.
[2021-05-15 01:36:06] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2021-05-15 01:36:06] [INFO ] Computed 23 place invariants in 8 ms
[2021-05-15 01:36:06] [INFO ] Implicit Places using invariants in 293 ms returned []
[2021-05-15 01:36:06] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2021-05-15 01:36:06] [INFO ] Computed 23 place invariants in 3 ms
[2021-05-15 01:36:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-15 01:36:08] [INFO ] Implicit Places using invariants and state equation in 1982 ms returned []
Implicit Place search using SMT with State Equation took 2280 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 126/138 places, 529/451 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 4935 ms. (steps per millisecond=202 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1329 ms. (steps per millisecond=752 ) properties seen :[0]
Interrupted probabilistic random walk after 11412706 steps, run timeout after 30001 ms. (steps per millisecond=380 ) properties seen :[0]
Probabilistic random walk after 11412706 steps, saw 2338380 distinct states, run finished after 30001 ms. (steps per millisecond=380 ) properties seen :[0]
[2021-05-15 01:36:44] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2021-05-15 01:36:44] [INFO ] Computed 23 place invariants in 6 ms
[2021-05-15 01:36:44] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-15 01:36:44] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 13 ms returned sat
[2021-05-15 01:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:36:45] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2021-05-15 01:36:45] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-15 01:36:45] [INFO ] [Real]Added 43 Read/Feed constraints in 113 ms returned sat
[2021-05-15 01:36:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 01:36:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2021-05-15 01:36:45] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 12 ms returned sat
[2021-05-15 01:36:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 01:36:45] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2021-05-15 01:36:45] [INFO ] [Nat]Added 43 Read/Feed constraints in 240 ms returned sat
[2021-05-15 01:36:46] [INFO ] Deduced a trap composed of 22 places in 213 ms
[2021-05-15 01:36:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2021-05-15 01:36:46] [INFO ] Computed and/alt/rep : 523/19500/350 causal constraints in 76 ms.
[2021-05-15 01:37:07] [INFO ] Added : 250 causal constraints over 50 iterations in 20960 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 277 ms.
Incomplete Parikh walk after 116400 steps, including 1000 resets, run finished after 503 ms. (steps per millisecond=231 ) properties seen :[0] could not realise parikh vector
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 29 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 27 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2021-05-15 01:37:07] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2021-05-15 01:37:07] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-15 01:37:08] [INFO ] Implicit Places using invariants in 318 ms returned []
[2021-05-15 01:37:08] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2021-05-15 01:37:08] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-15 01:37:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-15 01:37:10] [INFO ] Implicit Places using invariants and state equation in 2029 ms returned []
Implicit Place search using SMT with State Equation took 2349 ms to find 0 implicit places.
[2021-05-15 01:37:10] [INFO ] Redundant transitions in 14 ms returned []
[2021-05-15 01:37:10] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2021-05-15 01:37:10] [INFO ] Computed 23 place invariants in 4 ms
[2021-05-15 01:37:11] [INFO ] Dead Transitions using invariants and state equation in 690 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 529/529 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 350 ms. (steps per millisecond=285 ) properties seen :[0]
[2021-05-15 01:37:11] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2021-05-15 01:37:11] [INFO ] Computed 23 place invariants in 2 ms
[2021-05-15 01:37:11] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-15 01:37:11] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 10 ms returned sat
[2021-05-15 01:37:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:37:11] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2021-05-15 01:37:11] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-15 01:37:11] [INFO ] [Real]Added 43 Read/Feed constraints in 113 ms returned sat
[2021-05-15 01:37:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 01:37:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-15 01:37:11] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 7 ms returned sat
[2021-05-15 01:37:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 01:37:12] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2021-05-15 01:37:12] [INFO ] [Nat]Added 43 Read/Feed constraints in 149 ms returned sat
[2021-05-15 01:37:12] [INFO ] Deduced a trap composed of 22 places in 176 ms
[2021-05-15 01:37:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2021-05-15 01:37:12] [INFO ] Computed and/alt/rep : 523/19500/350 causal constraints in 44 ms.
[2021-05-15 01:37:31] [INFO ] Added : 255 causal constraints over 51 iterations in 19442 ms. Result :(error "Solver has unexpectedly terminated")
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 126 transition count 356
Symmetric choice reduction at 1 with 30 rule applications. Total rules 203 place count 126 transition count 356
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 60 transitions.
Iterating global reduction 1 with 60 rules applied. Total rules applied 263 place count 96 transition count 296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 266 place count 94 transition count 295
Graph (trivial) has 19 edges and 94 vertex of which 8 / 94 are part of one of the 1 SCC in 32 ms
Free SCC test removed 7 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 267 place count 87 transition count 295
Drop transitions removed 19 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 430 place count 87 transition count 132
Applied a total of 430 rules in 69 ms. Remains 87 /126 variables (removed 39) and now considering 132/529 (removed 397) transitions.
// Phase 1: matrix 132 rows 87 cols
[2021-05-15 01:37:31] [INFO ] Computed 22 place invariants in 13 ms
[2021-05-15 01:37:31] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2021-05-15 01:37:31] [INFO ] [Real]Absence check using 9 positive and 13 generalized place invariants in 10 ms returned sat
[2021-05-15 01:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:37:32] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2021-05-15 01:37:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-15 01:37:32] [INFO ] [Real]Added 6 Read/Feed constraints in 7 ms returned sat
[2021-05-15 01:37:32] [INFO ] Computed and/alt/rep : 126/1524/126 causal constraints in 17 ms.
[2021-05-15 01:37:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 01:37:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2021-05-15 01:37:32] [INFO ] [Nat]Absence check using 9 positive and 13 generalized place invariants in 7 ms returned sat
[2021-05-15 01:37:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 01:37:32] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-15 01:37:32] [INFO ] [Nat]Added 6 Read/Feed constraints in 20 ms returned sat
[2021-05-15 01:37:32] [INFO ] Computed and/alt/rep : 126/1524/126 causal constraints in 15 ms.
[2021-05-15 01:37:33] [INFO ] Added : 126 causal constraints over 26 iterations in 716 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-15 01:37:33] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2021-05-15 01:37:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
[2021-05-15 01:37:33] [INFO ] Flatten gal took : 202 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ SafeBus-COL-06 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ SafeBus-COL-06

{
"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": "Sat May 15 01:37:34 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 21396,
"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": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G ((p113 + p114 + p115 + p116 + p117 + p118 <= 5)))",
"processed_size": 54,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 3754,
"conflict_clusters": 7,
"places": 126,
"places_significant": 103,
"singleton_clusters": 0,
"transitions": 529
},
"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: 655/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 126
lola: finding significant places
lola: 126 places, 529 transitions, 103 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 ((p113 + p114 + p115 + p116 + p117 + p118 <= 5)))
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 ((p113 + p114 + p115 + p116 + p117 + p118 <= 5)))
lola: processed formula length: 54
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: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (6 <= p113 + p114 + p115 + p116 + p117 + p118)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: memory consumption: 21396 KB
lola: time consumption: 3 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="SafeBus-COL-06"
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 SafeBus-COL-06, 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 r208-smll-162089471100111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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