## About the Execution of 2020-gold for BridgeAndVehicles-PT-V50P50N10

Execution Summary | |||||

Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |

4300.039 | 3600000.00 | 154826.00 | 132.60 | FTF?TTFTFTTTTFTT | normal |

## Execution Chart

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

## Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038176900127.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BridgeAndVehicles-PT-V50P50N10, examination is ReachabilityCardinality

Time confinement is 3600 seconds

Memory confinement is 16384 MBytes

Number of cores is 4

Run identifier is r037-tajo-162038176900127

=====================================================================

--------------------

preparation of the directory to be used:

/home/mcc/execution

total 5.1M

-rw-r--r-- 1 mcc users 67K May 5 16:58 CTLCardinality.txt

-rw-r--r-- 1 mcc users 293K May 10 09:42 CTLCardinality.xml

-rw-r--r-- 1 mcc users 522K May 5 16:58 CTLFireability.txt

-rw-r--r-- 1 mcc users 2.0M May 10 09:42 CTLFireability.xml

-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml

-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml

-rw-r--r-- 1 mcc users 11K Mar 28 15:47 LTLCardinality.txt

-rw-r--r-- 1 mcc users 43K Mar 28 15:47 LTLCardinality.xml

-rw-r--r-- 1 mcc users 78K Mar 28 15:47 LTLFireability.txt

-rw-r--r-- 1 mcc users 228K Mar 28 15:47 LTLFireability.xml

-rw-r--r-- 1 mcc users 7.5K Mar 23 02:52 ReachabilityCardinality.txt

-rw-r--r-- 1 mcc users 27K Mar 23 02:52 ReachabilityCardinality.xml

-rw-r--r-- 1 mcc users 111K Mar 22 11:26 ReachabilityFireability.txt

-rw-r--r-- 1 mcc users 324K Mar 22 11:26 ReachabilityFireability.xml

-rw-r--r-- 1 mcc users 2.9K Mar 22 09:10 UpperBounds.txt

-rw-r--r-- 1 mcc users 5.9K Mar 22 09:10 UpperBounds.xml

-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col

-rw-r--r-- 1 mcc users 10 May 5 16:51 instance

-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored

-rw-r--r-- 1 mcc users 1.5M 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 BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-00

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-01

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-02

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-03

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-04

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-05

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-06

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-07

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-08

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-09

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-10

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-11

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-12

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-13

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-14

FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-15

=== Now, execution of the tool begins

**BK_START 1620932350880
**

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N

[2021-05-13 18:59: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-13 18:59:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml

[2021-05-13 18:59:13] [INFO ] Load time of PNML (sax parser for PT used): 195 ms

[2021-05-13 18:59:13] [INFO ] Transformed 128 places.

[2021-05-13 18:59:13] [INFO ] Transformed 1328 transitions.

[2021-05-13 18:59:13] [INFO ] Parsed PT model containing 128 places and 1328 transitions in 274 ms.

Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 65 ms.

Working with output stream class java.io.PrintStream
**FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
****FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
**

Incomplete random walk after 10000 steps, including 22 resets, run finished after 164 ms. (steps per millisecond=60 ) properties seen :[1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0]
**FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
****FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
**

Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 0, 1, 0]
**FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
****FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
****FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
**

Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]

Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]

Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]

Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0]

Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 1, 0]
**FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
**

Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0]

[2021-05-13 18:59:14] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)

// Phase 1: matrix 250 rows 128 cols

[2021-05-13 18:59:14] [INFO ] Computed 7 place invariants in 13 ms

[2021-05-13 18:59:14] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned unsat

[2021-05-13 18:59:14] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat

[2021-05-13 18:59:14] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat

[2021-05-13 18:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-13 18:59:14] [INFO ] [Real]Absence check using state equation in 151 ms returned sat

[2021-05-13 18:59:14] [INFO ] Solution in real domain found non-integer solution.

[2021-05-13 18:59:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat

[2021-05-13 18:59:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-13 18:59:14] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat

[2021-05-13 18:59:14] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-13 18:59:14] [INFO ] [Nat]Added 22 Read/Feed constraints in 81 ms returned sat

[2021-05-13 18:59:15] [INFO ] Deduced a trap composed of 5 places in 266 ms

[2021-05-13 18:59:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms

[2021-05-13 18:59:15] [INFO ] Computed and/alt/rep : 1325/22399/247 causal constraints in 140 ms.

[2021-05-13 18:59:19] [INFO ] Added : 190 causal constraints over 38 iterations in 4382 ms. Result :unknown

[2021-05-13 18:59:19] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat

[2021-05-13 18:59:19] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat

[2021-05-13 18:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-13 18:59:19] [INFO ] [Real]Absence check using state equation in 76 ms returned sat

[2021-05-13 18:59:19] [INFO ] Solution in real domain found non-integer solution.

[2021-05-13 18:59:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned unsat

[2021-05-13 18:59:19] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat

[2021-05-13 18:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-13 18:59:19] [INFO ] [Real]Absence check using state equation in 84 ms returned sat

[2021-05-13 18:59:19] [INFO ] Solution in real domain found non-integer solution.

[2021-05-13 18:59:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 53 ms returned unsat
**FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
****FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
****FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
****FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
****FORMULA BridgeAndVehicles-PT-V50P50N10-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
**

Incomplete Parikh walk after 30400 steps, including 348 resets, run finished after 156 ms. (steps per millisecond=194 ) properties seen :[0] could not realise parikh vector

Support contains 5 out of 128 places. Attempting structural reductions.

Starting structural reductions, iteration 0 : 128/128 places, 1328/1328 transitions.

Discarding 2 places :

Also discarding 0 output transitions

Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.27 ms

Applied a total of 1 rules in 259 ms. Remains 126 /128 variables (removed 2) and now considering 1328/1328 (removed 0) transitions.

[2021-05-13 18:59:20] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)

// Phase 1: matrix 250 rows 126 cols

[2021-05-13 18:59:20] [INFO ] Computed 5 place invariants in 2 ms

[2021-05-13 18:59:21] [INFO ] Dead Transitions using invariants and state equation in 1443 ms returned []

Finished structural reductions, in 1 iterations. Remains : 126/128 places, 1328/1328 transitions.

Incomplete random walk after 1000000 steps, including 2272 resets, run finished after 4041 ms. (steps per millisecond=247 ) properties seen :[0]

Incomplete Best-First random walk after 1000001 steps, including 741 resets, run finished after 1314 ms. (steps per millisecond=761 ) properties seen :[0]

Interrupted probabilistic random walk after 8223349 steps, run timeout after 30001 ms. (steps per millisecond=274 ) properties seen :[0]

Probabilistic random walk after 8223349 steps, saw 1980237 distinct states, run finished after 30001 ms. (steps per millisecond=274 ) properties seen :[0]

[2021-05-13 18:59:57] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)

// Phase 1: matrix 250 rows 126 cols

[2021-05-13 18:59:57] [INFO ] Computed 5 place invariants in 3 ms

[2021-05-13 18:59:57] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat

[2021-05-13 18:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-13 18:59:57] [INFO ] [Real]Absence check using state equation in 143 ms returned sat

[2021-05-13 18:59:57] [INFO ] Solution in real domain found non-integer solution.

[2021-05-13 18:59:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat

[2021-05-13 18:59:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-13 18:59:57] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat

[2021-05-13 18:59:57] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-13 18:59:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 52 ms returned sat

[2021-05-13 18:59:57] [INFO ] Deduced a trap composed of 7 places in 149 ms

[2021-05-13 18:59:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms

[2021-05-13 18:59:57] [INFO ] Computed and/alt/rep : 1325/22399/247 causal constraints in 43 ms.

[2021-05-13 19:00:03] [INFO ] Added : 211 causal constraints over 43 iterations in 5538 ms. Result :sat

[2021-05-13 19:00:03] [INFO ] Deduced a trap composed of 15 places in 106 ms

[2021-05-13 19:00:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms

Attempting to minimize the solution found.

Minimization took 91 ms.

Incomplete Parikh walk after 27600 steps, including 452 resets, run finished after 117 ms. (steps per millisecond=235 ) properties seen :[0] could not realise parikh vector

Support contains 5 out of 126 places. Attempting structural reductions.

Starting structural reductions, iteration 0 : 126/126 places, 1328/1328 transitions.

Applied a total of 0 rules in 125 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.

Finished structural reductions, in 1 iterations. Remains : 126/126 places, 1328/1328 transitions.

Starting structural reductions, iteration 0 : 126/126 places, 1328/1328 transitions.

Applied a total of 0 rules in 116 ms. Remains 126 /126 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.

[2021-05-13 19:00:04] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)

// Phase 1: matrix 250 rows 126 cols

[2021-05-13 19:00:04] [INFO ] Computed 5 place invariants in 4 ms

[2021-05-13 19:00:04] [INFO ] Implicit Places using invariants in 245 ms returned []

[2021-05-13 19:00:04] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)

// Phase 1: matrix 250 rows 126 cols

[2021-05-13 19:00:04] [INFO ] Computed 5 place invariants in 2 ms

[2021-05-13 19:00:04] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-13 19:00:05] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned [108]

Discarding 1 places :

Implicit Place search using SMT with State Equation took 1356 ms to find 1 implicit places.

[2021-05-13 19:00:05] [INFO ] Redundant transitions in 79 ms returned []

[2021-05-13 19:00:05] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)

// Phase 1: matrix 250 rows 125 cols

[2021-05-13 19:00:05] [INFO ] Computed 5 place invariants in 2 ms

[2021-05-13 19:00:08] [INFO ] Dead Transitions using invariants and state equation in 2933 ms returned []

Starting structural reductions, iteration 1 : 125/126 places, 1328/1328 transitions.

Applied a total of 0 rules in 133 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.

[2021-05-13 19:00:08] [INFO ] Redundant transitions in 29 ms returned []

[2021-05-13 19:00:08] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)

// Phase 1: matrix 250 rows 125 cols

[2021-05-13 19:00:08] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-13 19:00:09] [INFO ] Dead Transitions using invariants and state equation in 880 ms returned []

Finished structural reductions, in 2 iterations. Remains : 125/126 places, 1328/1328 transitions.

Incomplete random walk after 1000000 steps, including 2273 resets, run finished after 4156 ms. (steps per millisecond=240 ) properties seen :[0]

Incomplete Best-First random walk after 1000000 steps, including 742 resets, run finished after 1448 ms. (steps per millisecond=690 ) properties seen :[0]

Interrupted probabilistic random walk after 7968285 steps, run timeout after 30001 ms. (steps per millisecond=265 ) properties seen :[0]

Probabilistic random walk after 7968285 steps, saw 1921023 distinct states, run finished after 30001 ms. (steps per millisecond=265 ) properties seen :[0]

[2021-05-13 19:00:45] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)

// Phase 1: matrix 250 rows 125 cols

[2021-05-13 19:00:45] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-13 19:00:45] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat

[2021-05-13 19:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-13 19:00:45] [INFO ] [Real]Absence check using state equation in 147 ms returned sat

[2021-05-13 19:00:45] [INFO ] Solution in real domain found non-integer solution.

[2021-05-13 19:00:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat

[2021-05-13 19:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-13 19:00:45] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat

[2021-05-13 19:00:45] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-13 19:00:45] [INFO ] [Nat]Added 22 Read/Feed constraints in 55 ms returned sat

[2021-05-13 19:00:45] [INFO ] Deduced a trap composed of 14 places in 104 ms

[2021-05-13 19:00:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms

[2021-05-13 19:00:45] [INFO ] Computed and/alt/rep : 1325/19849/247 causal constraints in 34 ms.

[2021-05-13 19:00:55] [INFO ] Added : 236 causal constraints over 48 iterations in 9843 ms. Result :sat

[2021-05-13 19:00:55] [INFO ] Deduced a trap composed of 5 places in 114 ms

[2021-05-13 19:00:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 448 ms

Attempting to minimize the solution found.

Minimization took 125 ms.

Incomplete Parikh walk after 15500 steps, including 169 resets, run finished after 73 ms. (steps per millisecond=212 ) properties seen :[0] could not realise parikh vector

Support contains 5 out of 125 places. Attempting structural reductions.

Starting structural reductions, iteration 0 : 125/125 places, 1328/1328 transitions.

Applied a total of 0 rules in 117 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.

Finished structural reductions, in 1 iterations. Remains : 125/125 places, 1328/1328 transitions.

Starting structural reductions, iteration 0 : 125/125 places, 1328/1328 transitions.

Applied a total of 0 rules in 110 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.

[2021-05-13 19:00:56] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)

// Phase 1: matrix 250 rows 125 cols

[2021-05-13 19:00:56] [INFO ] Computed 5 place invariants in 2 ms

[2021-05-13 19:00:56] [INFO ] Implicit Places using invariants in 379 ms returned []

[2021-05-13 19:00:56] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)

// Phase 1: matrix 250 rows 125 cols

[2021-05-13 19:00:56] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-13 19:00:57] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-13 19:00:57] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []

Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.

[2021-05-13 19:00:57] [INFO ] Redundant transitions in 15 ms returned []

[2021-05-13 19:00:57] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)

// Phase 1: matrix 250 rows 125 cols

[2021-05-13 19:00:57] [INFO ] Computed 5 place invariants in 1 ms

[2021-05-13 19:00:58] [INFO ] Dead Transitions using invariants and state equation in 775 ms returned []

Finished structural reductions, in 1 iterations. Remains : 125/125 places, 1328/1328 transitions.

Incomplete random walk after 100000 steps, including 227 resets, run finished after 338 ms. (steps per millisecond=295 ) properties seen :[0]

[2021-05-13 19:00:58] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)

// Phase 1: matrix 250 rows 125 cols

[2021-05-13 19:00:58] [INFO ] Computed 5 place invariants in 2 ms

[2021-05-13 19:00:58] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat

[2021-05-13 19:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-13 19:00:59] [INFO ] [Real]Absence check using state equation in 110 ms returned sat

[2021-05-13 19:00:59] [INFO ] Solution in real domain found non-integer solution.

[2021-05-13 19:00:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat

[2021-05-13 19:00:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-13 19:00:59] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat

[2021-05-13 19:00:59] [INFO ] State equation strengthened by 22 read => feed constraints.

[2021-05-13 19:00:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 48 ms returned sat

[2021-05-13 19:00:59] [INFO ] Deduced a trap composed of 14 places in 134 ms

[2021-05-13 19:00:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms

[2021-05-13 19:00:59] [INFO ] Computed and/alt/rep : 1325/19849/247 causal constraints in 41 ms.

[2021-05-13 19:01:09] [INFO ] Added : 243 causal constraints over 50 iterations in 10539 ms. Result :sat

Ensure Unique test removed 1078 transitions

Reduce isomorphic transitions removed 1078 transitions.

Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 125 transition count 250

Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2

Deduced a syphon composed of 2 places in 0 ms

Reduce places removed 2 places and 0 transitions.

Iterating global reduction 1 with 4 rules applied. Total rules applied 1082 place count 123 transition count 248

Free-agglomeration rule (complex) applied 1 times.

Iterating global reduction 1 with 1 rules applied. Total rules applied 1083 place count 123 transition count 247

Reduce places removed 1 places and 0 transitions.

Iterating post reduction 1 with 1 rules applied. Total rules applied 1084 place count 122 transition count 247

Applied a total of 1084 rules in 38 ms. Remains 122 /125 variables (removed 3) and now considering 247/1328 (removed 1081) transitions.

// Phase 1: matrix 247 rows 122 cols

[2021-05-13 19:01:10] [INFO ] Computed 5 place invariants in 4 ms

[2021-05-13 19:01:10] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat

[2021-05-13 19:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.

[2021-05-13 19:01:10] [INFO ] [Real]Absence check using state equation in 124 ms returned sat

[2021-05-13 19:01:10] [INFO ] Solution in real domain found non-integer solution.

[2021-05-13 19:01:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat

[2021-05-13 19:01:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.

[2021-05-13 19:01:10] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat

[2021-05-13 19:01:10] [INFO ] State equation strengthened by 1 read => feed constraints.

[2021-05-13 19:01:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 27 ms returned sat

[2021-05-13 19:01:10] [INFO ] Computed and/alt/rep : 244/5025/244 causal constraints in 34 ms.

[2021-05-13 19:01:13] [INFO ] Added : 231 causal constraints over 47 iterations in 3440 ms. Result :sat

Attempting to minimize the solution found.

Minimization took 61 ms.

[2021-05-13 19:01:13] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.

[2021-05-13 19:01:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.

[2021-05-13 19:01:14] [INFO ] Flatten gal took : 195 ms

info: Time: 3600 - MCC

vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-PT-V50P50N10 @ 3570 seconds

vrfy: finished

info: timeLeft: 3566

rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-PT-V50P50N10

{

"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",

"--check=modelchecking",

"--stubborn=tarjan",

"--stateequation=par",

"--timelimit=3570",

"--localtimelimit=0",

"--json=ReachabilityCardinality.json",

"--jsoninclude=formula,formulastat,net"

],

"starttime": "Thu May 13 19:01:14 2021

",

"timelimit": 3570

},

"child": null,

"exit":

{

"error": null,

"localtimelimitreached": true,

"memory": 41444,

"runtime": 4.000000,

"signal": null,

"timelimitreached": false

},

"files":

{

"formula": "ReachabilityCardinality.xml",

"net": "model.pnml"

},

"formula":

{

"count":

{

"A": 0,

"E": 1,

"F": 1,

"G": 0,

"U": 0,

"X": 0,

"aconj": 1,

"adisj": 1,

"aneg": 0,

"comp": 3,

"cont": 0,

"dl": 0,

"fir": 0,

"nodl": 0,

"place_references": 3,

"taut": 0,

"tconj": 0,

"tdisj": 0,

"tneg": 0,

"transition_references": 0,

"unfir": 0,

"visible_places": 3,

"visible_transitions": 0

},

"processed": "E (F (((2 <= p110) AND (2 <= p53) AND ((3 <= p52)))))",

"processed_size": 53,

"rewrites": 1,

"skeleton": "E(F(**))"

},

"net":

{

"arcs": 9907,

"conflict_clusters": 3,

"places": 125,

"places_significant": 120,

"singleton_clusters": 0,

"transitions": 1328

},

"task":

{

"search":

{

"store":

{

"encoder": "simple compression",

"type": "prefix"

},

"stubborn":

{

"type": "reachability preserving/insertion"

},

"threads": 1,

"type": "dfs"

},

"stateequation":

{

"literals": 3,

"problems": 3

},

"type": "reachability",

"workflow": "stateequation||search"

}

}

lola: LoLA will run for 3570 seconds at most (--timelimit)

lola: NET

lola: input: PNML file (--pnml)

lola: reading net from model.pnml

lola: reading pnml

lola: PNML file contains place/transition net

lola: finished parsing

lola: closed net file model.pnml

lola: 1453/268435456 symbol table entries, 0 collisions

lola: preprocessing...

lola: Size of bit vector: 4000

lola: finding significant places

lola: 125 places, 1328 transitions, 120 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: LP says that atomic proposition is always false: (2 <= p55 + p56)

lola: E (F (((2 <= p110) AND (2 <= p53) AND ((3 <= p52)))))

lola: checking reachability

lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: processed formula: E (F (((2 <= p110) AND (2 <= p53) AND ((3 <= p52)))))

lola: processed formula length: 53

lola: 1 rewrites

lola: closed formula file ReachabilityCardinality.xml

lola: STORE

lola: using a simple compression encoder (--encoder=simplecompressed)

lola: using a prefix tree store (--store=prefix)

lola: SEARCH (state space)

lola: state space: using reachability graph (--search=depth)

lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)

lola: built state equation task

lola: RUNNING

lola: subprocess will run for 0 seconds at most (--localtimelimit)

lola: state equation task get result started, id 0

lola: local time limit reached - aborting

lola: rewrite Frontend/Parser/formula_rewrite.k:711

lola: state equation task get result rewrite finished id 0

lola: state equation task get result unparse finished++ id 0

lola: formula 0: ((2 <= p110) AND (2 <= p53) AND ((3 <= p52)))

lola: state equation task get result unparse finished id 0

lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas

lola: memory consumption: 41444 KB

lola: time consumption: 4 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="BridgeAndVehicles-PT-V50P50N10"

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 BridgeAndVehicles-PT-V50P50N10, 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 r037-tajo-162038176900127"

echo "====================================================================="

echo

echo "--------------------"

echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P50N10.tgz

mv BridgeAndVehicles-PT-V50P50N10 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 '

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 ;