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-162038176800092.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-V20P10N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038176800092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 27K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 274K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M 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 5.0K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 127K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 02:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 02:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 26K Mar 22 11:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 22 11:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K 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 598K 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-V20P10N10-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620929341635

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:09:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 18:09:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:09:03] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2021-05-13 18:09:03] [INFO ] Transformed 68 places.
[2021-05-13 18:09:03] [INFO ] Transformed 548 transitions.
[2021-05-13 18:09:03] [INFO ] Parsed PT model containing 68 places and 548 transitions in 110 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 56 resets, run finished after 104 ms. (steps per millisecond=96 ) properties seen :[0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 196 ms. (steps per millisecond=51 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 473 ms. (steps per millisecond=21 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2021-05-13 18:09:04] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2021-05-13 18:09:04] [INFO ] Computed 7 place invariants in 9 ms
[2021-05-13 18:09:04] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned sat
[2021-05-13 18:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:09:04] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2021-05-13 18:09:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:09:04] [INFO ] [Real]Added 22 Read/Feed constraints in 17 ms returned sat
[2021-05-13 18:09:04] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 50 ms.
[2021-05-13 18:09:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:09:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2021-05-13 18:09:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:09:04] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-13 18:09:04] [INFO ] [Nat]Added 22 Read/Feed constraints in 19 ms returned sat
[2021-05-13 18:09:05] [INFO ] Deduced a trap composed of 15 places in 116 ms
[2021-05-13 18:09:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2021-05-13 18:09:05] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 37 ms.
[2021-05-13 18:09:06] [INFO ] Added : 124 causal constraints over 26 iterations in 1030 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 56 ms.
[2021-05-13 18:09:06] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[2021-05-13 18:09:06] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2021-05-13 18:09:06] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 18:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:09:06] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-13 18:09:06] [INFO ] [Real]Added 22 Read/Feed constraints in 7 ms returned sat
[2021-05-13 18:09:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:09:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-13 18:09:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:09:06] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-13 18:09:06] [INFO ] [Nat]Added 22 Read/Feed constraints in 29 ms returned sat
[2021-05-13 18:09:06] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 32 ms.
[2021-05-13 18:09:08] [INFO ] Added : 118 causal constraints over 24 iterations in 1565 ms. Result :sat
[2021-05-13 18:09:08] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2021-05-13 18:09:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
Attempting to minimize the solution found.
Minimization took 57 ms.
[2021-05-13 18:09:08] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2021-05-13 18:09:08] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-13 18:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:09:08] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-13 18:09:08] [INFO ] [Real]Added 22 Read/Feed constraints in 10 ms returned sat
[2021-05-13 18:09:08] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 29 ms.
[2021-05-13 18:09:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:09:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-13 18:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:09:08] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-13 18:09:08] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2021-05-13 18:09:08] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 24 ms.
[2021-05-13 18:09:09] [INFO ] Added : 113 causal constraints over 24 iterations in 1094 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2021-05-13 18:09:09] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 18:09:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:09:09] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-13 18:09:09] [INFO ] [Real]Added 22 Read/Feed constraints in 17 ms returned sat
[2021-05-13 18:09:09] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 22 ms.
[2021-05-13 18:09:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:09:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2021-05-13 18:09:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:09:09] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-13 18:09:09] [INFO ] [Nat]Added 22 Read/Feed constraints in 11 ms returned sat
[2021-05-13 18:09:10] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 23 ms.
[2021-05-13 18:09:10] [INFO ] Added : 93 causal constraints over 23 iterations in 742 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-13 18:09:10] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2021-05-13 18:09:10] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 18800 steps, including 740 resets, run finished after 94 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 34900 steps, including 1061 resets, run finished after 148 ms. (steps per millisecond=235 ) properties seen :[0, 0, 1, 0] could not realise parikh vector
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 46300 steps, including 1115 resets, run finished after 269 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 64100 steps, including 1176 resets, run finished after 243 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 38 out of 68 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 68/68 places, 548/548 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Applied a total of 1 rules in 89 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2021-05-13 18:09:11] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2021-05-13 18:09:11] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 18:09:12] [INFO ] Dead Transitions using invariants and state equation in 358 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/68 places, 548/548 transitions.
Incomplete random walk after 1000000 steps, including 5633 resets, run finished after 2052 ms. (steps per millisecond=487 ) properties seen :[0, 1, 0]
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1914 resets, run finished after 1625 ms. (steps per millisecond=615 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2218 resets, run finished after 1077 ms. (steps per millisecond=928 ) properties seen :[0, 1]
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-13 18:09:16] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2021-05-13 18:09:16] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:09:16] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2021-05-13 18:09:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:09:16] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-13 18:09:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:09:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 18 ms returned sat
[2021-05-13 18:09:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:09:17] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2021-05-13 18:09:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:09:17] [INFO ] [Nat]Added 22 Read/Feed constraints in 11 ms returned sat
[2021-05-13 18:09:17] [INFO ] Deduced a trap composed of 17 places in 65 ms
[2021-05-13 18:09:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2021-05-13 18:09:17] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 25 ms.
[2021-05-13 18:09:18] [INFO ] Added : 123 causal constraints over 25 iterations in 986 ms. Result :sat
[2021-05-13 18:09:18] [INFO ] Deduced a trap composed of 15 places in 58 ms
[2021-05-13 18:09:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
Incomplete Parikh walk after 64000 steps, including 1111 resets, run finished after 277 ms. (steps per millisecond=231 ) properties seen :[0] could not realise parikh vector
Support contains 24 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 24 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Incomplete random walk after 1000000 steps, including 5633 resets, run finished after 2433 ms. (steps per millisecond=411 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 1913 resets, run finished after 1690 ms. (steps per millisecond=591 ) properties seen :[0]
Interrupted probabilistic random walk after 13136421 steps, run timeout after 30001 ms. (steps per millisecond=437 ) properties seen :[0]
Probabilistic random walk after 13136421 steps, saw 2966738 distinct states, run finished after 30001 ms. (steps per millisecond=437 ) properties seen :[0]
[2021-05-13 18:09:52] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2021-05-13 18:09:52] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:09:52] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-13 18:09:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:09:52] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-13 18:09:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:09:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2021-05-13 18:09:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:09:52] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-13 18:09:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:09:52] [INFO ] [Nat]Added 22 Read/Feed constraints in 11 ms returned sat
[2021-05-13 18:09:52] [INFO ] Deduced a trap composed of 17 places in 67 ms
[2021-05-13 18:09:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2021-05-13 18:09:52] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 20 ms.
[2021-05-13 18:09:54] [INFO ] Added : 123 causal constraints over 25 iterations in 1124 ms. Result :sat
[2021-05-13 18:09:54] [INFO ] Deduced a trap composed of 15 places in 78 ms
[2021-05-13 18:09:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
Attempting to minimize the solution found.
Minimization took 49 ms.
Incomplete Parikh walk after 64000 steps, including 1108 resets, run finished after 274 ms. (steps per millisecond=233 ) properties seen :[0] could not realise parikh vector
Support contains 24 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 54 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Starting structural reductions, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 45 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2021-05-13 18:09:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2021-05-13 18:09:54] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:09:54] [INFO ] Implicit Places using invariants in 103 ms returned []
[2021-05-13 18:09:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2021-05-13 18:09:54] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:09:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:09:55] [INFO ] Implicit Places using invariants and state equation in 258 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 374 ms to find 1 implicit places.
[2021-05-13 18:09:55] [INFO ] Redundant transitions in 61 ms returned []
[2021-05-13 18:09:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2021-05-13 18:09:55] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:09:55] [INFO ] Dead Transitions using invariants and state equation in 358 ms returned []
Starting structural reductions, iteration 1 : 65/66 places, 548/548 transitions.
Applied a total of 0 rules in 21 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2021-05-13 18:09:55] [INFO ] Redundant transitions in 5 ms returned []
[2021-05-13 18:09:55] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2021-05-13 18:09:55] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:09:55] [INFO ] Dead Transitions using invariants and state equation in 342 ms returned []
Finished structural reductions, in 2 iterations. Remains : 65/66 places, 548/548 transitions.
Incomplete random walk after 1000000 steps, including 5633 resets, run finished after 2226 ms. (steps per millisecond=449 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 1912 resets, run finished after 1658 ms. (steps per millisecond=603 ) properties seen :[0]
Interrupted probabilistic random walk after 12698974 steps, run timeout after 30001 ms. (steps per millisecond=423 ) properties seen :[0]
Probabilistic random walk after 12698974 steps, saw 2870314 distinct states, run finished after 30003 ms. (steps per millisecond=423 ) properties seen :[0]
[2021-05-13 18:10:29] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2021-05-13 18:10:29] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:10:29] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2021-05-13 18:10:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:10:29] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-13 18:10:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:10:29] [INFO ] [Real]Added 22 Read/Feed constraints in 22 ms returned sat
[2021-05-13 18:10:29] [INFO ] Deduced a trap composed of 15 places in 43 ms
[2021-05-13 18:10:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2021-05-13 18:10:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:10:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2021-05-13 18:10:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:10:30] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-13 18:10:30] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2021-05-13 18:10:30] [INFO ] Computed and/alt/rep : 545/7369/127 causal constraints in 13 ms.
[2021-05-13 18:10:31] [INFO ] Added : 115 causal constraints over 24 iterations in 1230 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
Incomplete Parikh walk after 26200 steps, including 711 resets, run finished after 134 ms. (steps per millisecond=195 ) properties seen :[0] could not realise parikh vector
Support contains 24 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 548/548 transitions.
Applied a total of 0 rules in 21 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 548/548 transitions.
Starting structural reductions, iteration 0 : 65/65 places, 548/548 transitions.
Applied a total of 0 rules in 19 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2021-05-13 18:10:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2021-05-13 18:10:31] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:10:31] [INFO ] Implicit Places using invariants in 152 ms returned []
[2021-05-13 18:10:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2021-05-13 18:10:31] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:10:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:10:32] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2021-05-13 18:10:32] [INFO ] Redundant transitions in 6 ms returned []
[2021-05-13 18:10:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2021-05-13 18:10:32] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 18:10:32] [INFO ] Dead Transitions using invariants and state equation in 425 ms returned []
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 548/548 transitions.
Incomplete random walk after 100000 steps, including 563 resets, run finished after 293 ms. (steps per millisecond=341 ) properties seen :[0]
[2021-05-13 18:10:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2021-05-13 18:10:32] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 18:10:32] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2021-05-13 18:10:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:10:32] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-13 18:10:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 18:10:32] [INFO ] [Real]Added 22 Read/Feed constraints in 11 ms returned sat
[2021-05-13 18:10:33] [INFO ] Deduced a trap composed of 15 places in 89 ms
[2021-05-13 18:10:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2021-05-13 18:10:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:10:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-13 18:10:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:10:33] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-13 18:10:33] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat
[2021-05-13 18:10:33] [INFO ] Computed and/alt/rep : 545/7369/127 causal constraints in 19 ms.
[2021-05-13 18:10:34] [INFO ] Added : 115 causal constraints over 24 iterations in 956 ms. Result :sat
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 65 transition count 130
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 422 place count 63 transition count 128
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 63 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 424 place count 62 transition count 127
Applied a total of 424 rules in 23 ms. Remains 62 /65 variables (removed 3) and now considering 127/548 (removed 421) transitions.
// Phase 1: matrix 127 rows 62 cols
[2021-05-13 18:10:34] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 18:10:34] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned sat
[2021-05-13 18:10:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:10:34] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-13 18:10:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 18:10:34] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-13 18:10:34] [INFO ] Computed and/alt/rep : 124/1665/124 causal constraints in 11 ms.
[2021-05-13 18:10:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:10:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2021-05-13 18:10:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:10:34] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-13 18:10:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-13 18:10:34] [INFO ] Computed and/alt/rep : 124/1665/124 causal constraints in 9 ms.
[2021-05-13 18:10:34] [INFO ] Added : 112 causal constraints over 23 iterations in 462 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-13 18:10:34] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2021-05-13 18:10:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
[2021-05-13 18:10:35] [INFO ] Flatten gal took : 107 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ BridgeAndVehicles-PT-V20P10N10 @ 3570 seconds
vrfy: finished
info: timeLeft: 3466
rslt: Output for ReachabilityFireability @ BridgeAndVehicles-PT-V20P10N10

{
"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=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 18:10:35 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 45368,
"runtime": 104.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 21,
"adisj": 1,
"aneg": 0,
"comp": 81,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 81,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p22) AND (((1 <= p23) AND (1 <= p25) AND (1 <= p43) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p36) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p41) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p38) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p29) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p40) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p46) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p35) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p33) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p44) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p31) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p32) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p37) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p27) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p42) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p39) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p34) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p45) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p28) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p30) AND (1 <= p47))))))",
"processed_size": 1262,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 4027,
"conflict_clusters": 3,
"places": 65,
"places_significant": 60,
"singleton_clusters": 0,
"transitions": 548
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 100,
"problems": 20
},
"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: 613/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2080
lola: finding significant places
lola: 65 places, 548 transitions, 60 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 ReachabilityFireability.xml
lola: E (F (((1 <= p22) AND (((1 <= p23) AND (1 <= p25) AND (1 <= p43) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p36) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p41) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p38) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p29) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p40) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p46) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p35) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p33) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p44) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p31) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p32) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p37) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p27) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p42) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p39) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p34) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p45) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p28) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p30) AND (1 <= p47))))))
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 (((1 <= p22) AND (((1 <= p23) AND (1 <= p25) AND (1 <= p43) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p36) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p41) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p38) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p29) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p40) AND (1 <= p47)) OR ((1 <... (shortened)
lola: processed formula length: 1262
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p22) AND (((1 <= p23) AND (1 <= p25) AND (1 <= p43) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p36) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p41) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p38) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p29) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p40) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p46) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p35) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p33) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p44) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p31) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p32) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p37) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p27) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p42) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p39) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p34) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p45) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p28) AND (1 <= p47)) OR ((1 <= p23) AND (1 <= p25) AND (1 <= p30) AND (1 <= p47))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 100 literals and 20 conjunctive subformulas
lola: local time limit reached - aborting
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 45368 KB
lola: time consumption: 104 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.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-V20P10N10"
export BK_EXAMINATION="ReachabilityFireability"
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-V20P10N10, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-162038176800092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N10.tgz
mv BridgeAndVehicles-PT-V20P10N10 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;