Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397800222.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-PT-V20P20N50, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397800222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.6K Apr 13 02:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 02:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 435K Apr 13 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 13 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 256K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 787K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 13 04:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 213K Apr 13 04:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.3M Apr 13 03:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.9M May 18 16:42 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-V20P20N50-ReachabilityCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716286551279

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P20N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:15:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 10:15:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:15:53] [INFO ] Load time of PNML (sax parser for PT used): 239 ms
[2024-05-21 10:15:53] [INFO ] Transformed 108 places.
[2024-05-21 10:15:53] [INFO ] Transformed 2228 transitions.
[2024-05-21 10:15:53] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 455 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (228 resets) in 4144 ms. (9 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 14/15 properties
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (8 resets) in 139 ms. (28 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 124 ms. (32 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 153 ms. (25 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 187663 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :1 out of 14
Probabilistic random walk after 187663 steps, saw 51013 distinct states, run finished after 3006 ms. (steps per millisecond=62 ) properties seen :1
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-21 10:15:58] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 10:15:58] [INFO ] Computed 7 invariants in 22 ms
[2024-05-21 10:15:58] [INFO ] State equation strengthened by 102 read => feed constraints.
Problem BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Problem BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-10 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-11 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-15 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 16/108 variables, 3/7 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 290/398 variables, 108/115 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 102/217 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/217 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/398 variables, 0/217 constraints. Problems are: Problem set: 10 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 217 constraints, problems are : Problem set: 10 solved, 3 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 3 unsolved
Problem BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 37/108 variables, 6/7 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 290/398 variables, 108/115 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 102/217 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/219 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/219 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/398 variables, 0/219 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 219 constraints, problems are : Problem set: 11 solved, 2 unsolved in 957 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 2235ms problems are : Problem set: 11 solved, 2 unsolved
Parikh walk visited 0 properties in 2466 ms.
Support contains 68 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 528 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 10:16:03] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2024-05-21 10:16:03] [INFO ] Invariant cache hit.
[2024-05-21 10:16:03] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 10:16:29] [INFO ] Deduced a trap composed of 5 places in 369 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20089 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20074 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 1/1 constraints]
After SMT, in 58681ms problems are : Problem set: 0 solved, 2225 unsolved
Search for dead transitions found 0 dead transitions in 58782ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59383 ms. Remains : 108/108 places, 2228/2228 transitions.
RANDOM walk for 40001 steps (228 resets) in 1013 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (75 resets) in 333 ms. (119 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (65 resets) in 387 ms. (103 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 270054 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 2
Probabilistic random walk after 270054 steps, saw 70932 distinct states, run finished after 3002 ms. (steps per millisecond=89 ) properties seen :0
[2024-05-21 10:17:06] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2024-05-21 10:17:06] [INFO ] Invariant cache hit.
[2024-05-21 10:17:06] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 40/108 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 290/398 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 102/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/398 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 40/108 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 290/398 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 102/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/398 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 219 constraints, problems are : Problem set: 0 solved, 2 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1177ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2510 ms.
Support contains 68 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 246 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 108/108 places, 2228/2228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 249 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2024-05-21 10:17:10] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2024-05-21 10:17:10] [INFO ] Invariant cache hit.
[2024-05-21 10:17:10] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-21 10:17:10] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2024-05-21 10:17:10] [INFO ] Invariant cache hit.
[2024-05-21 10:17:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 10:17:10] [INFO ] Implicit Places using invariants and state equation in 477 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 712 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 107/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 174 ms. Remains 107 /107 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1136 ms. Remains : 107/108 places, 2228/2228 transitions.
RANDOM walk for 40000 steps (228 resets) in 448 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (76 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (67 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 313915 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 2
Probabilistic random walk after 313915 steps, saw 81240 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
[2024-05-21 10:17:14] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2024-05-21 10:17:14] [INFO ] Computed 6 invariants in 9 ms
[2024-05-21 10:17:14] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/106 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 290/396 variables, 106/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 102/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/106 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 290/396 variables, 106/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 102/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/397 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/397 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 980 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1431ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1860 ms.
Support contains 68 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 2228/2228 transitions.
Applied a total of 0 rules in 214 ms. Remains 107 /107 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 107/107 places, 2228/2228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 2228/2228 transitions.
Applied a total of 0 rules in 215 ms. Remains 107 /107 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2024-05-21 10:17:18] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2024-05-21 10:17:18] [INFO ] Invariant cache hit.
[2024-05-21 10:17:18] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-21 10:17:18] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2024-05-21 10:17:18] [INFO ] Invariant cache hit.
[2024-05-21 10:17:18] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 10:17:18] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2024-05-21 10:17:18] [INFO ] Redundant transitions in 146 ms returned []
Running 2225 sub problems to find dead transitions.
[2024-05-21 10:17:19] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
[2024-05-21 10:17:19] [INFO ] Invariant cache hit.
[2024-05-21 10:17:19] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 10:17:43] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 2 ms to minimize.
[2024-05-21 10:17:56] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 2 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/397 variables, and 7 constraints, problems are : Problem set: 20 solved, 2205 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 20 solved, 2205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 20 solved, 2205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 2/7 constraints. Problems are: Problem set: 20 solved, 2205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 2205 unsolved
SMT process timed out in 78495ms, After SMT, problems are : Problem set: 20 solved, 2205 unsolved
Search for dead transitions found 20 dead transitions in 78528ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 107/107 places, 2208/2228 transitions.
Applied a total of 0 rules in 186 ms. Remains 107 /107 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-05-21 10:18:37] [INFO ] Redundant transitions in 91 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 79897 ms. Remains : 107/107 places, 2208/2228 transitions.
RANDOM walk for 40000 steps (228 resets) in 475 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (75 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (67 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 310025 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 310025 steps, saw 80439 distinct states, run finished after 3002 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-21 10:18:41] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 107 cols
[2024-05-21 10:18:41] [INFO ] Computed 6 invariants in 6 ms
[2024-05-21 10:18:41] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/106 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 289/395 variables, 106/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 101/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/396 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/396 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/106 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 289/395 variables, 106/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 101/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/396 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/396 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 216 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1432ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1499 ms.
Support contains 68 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 2208/2208 transitions.
Applied a total of 0 rules in 191 ms. Remains 107 /107 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 107/107 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 2208/2208 transitions.
Applied a total of 0 rules in 195 ms. Remains 107 /107 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-05-21 10:18:44] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 10:18:44] [INFO ] Invariant cache hit.
[2024-05-21 10:18:44] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-21 10:18:44] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 10:18:44] [INFO ] Invariant cache hit.
[2024-05-21 10:18:44] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 10:18:45] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
[2024-05-21 10:18:45] [INFO ] Redundant transitions in 72 ms returned []
Running 2205 sub problems to find dead transitions.
[2024-05-21 10:18:45] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 10:18:45] [INFO ] Invariant cache hit.
[2024-05-21 10:18:45] [INFO ] State equation strengthened by 101 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V20P20N50

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 108
TRANSITIONS: 2228
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.078s, Sys 0.004s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.009s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 648
MODEL NAME: /home/mcc/execution/model
108 places, 2228 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-ReachabilityCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716287114813

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-V20P20N50"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is BridgeAndVehicles-PT-V20P20N50, 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 r047-tajo-171620397800222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P20N50.tgz
mv BridgeAndVehicles-PT-V20P20N50 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 ;