fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r028-smll-174853774800223
Last Updated
June 24, 2025

About the Execution of 2024-gold for BridgeAndVehicles-PT-V20P10N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15683.870 917736.00 1635700.00 2454.50 T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r028-smll-174853774800223.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is BridgeAndVehicles-PT-V20P10N50, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-smll-174853774800223
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 23K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 193K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 719K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 103K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 315K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 575K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.2M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.8M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748572022921

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BridgeAndVehicles-PT-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 02:27:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-30 02:27:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 02:27:06] [INFO ] Load time of PNML (sax parser for PT used): 439 ms
[2025-05-30 02:27:06] [INFO ] Transformed 108 places.
[2025-05-30 02:27:06] [INFO ] Transformed 2228 transitions.
[2025-05-30 02:27:06] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 649 ms.
RANDOM walk for 40001 steps (228 resets) in 4444 ms. (8 steps per ms) remains 29/108 properties
BEST_FIRST walk for 4002 steps (8 resets) in 101 ms. (39 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
[2025-05-30 02:27:08] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2025-05-30 02:27:08] [INFO ] Computed 7 invariants in 31 ms
[2025-05-30 02:27:08] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 22/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 202/253 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 50/303 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 91/394 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 102/211 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 4/398 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 0/398 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 217 constraints, problems are : Problem set: 0 solved, 29 unsolved in 3075 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 22/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 202/253 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 50/303 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 91/394 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 102/211 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 29/240 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2025-05-30 02:27:14] [INFO ] Deduced a trap composed of 5 places in 372 ms of which 23 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/398 variables, and 241 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 104/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 1/1 constraints]
After SMT, in 8326ms problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 882 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 2226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 101 transition count 2224
Applied a total of 10 rules in 608 ms. Remains 101 /108 variables (removed 7) and now considering 2224/2228 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 628 ms. Remains : 101/108 places, 2224/2228 transitions.
RANDOM walk for 4000000 steps (32086 resets) in 71377 ms. (56 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1328 resets) in 2945 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1327 resets) in 2927 ms. (136 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1328 resets) in 2897 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1328 resets) in 2911 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (1325 resets) in 2887 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1326 resets) in 2906 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1324 resets) in 3240 ms. (123 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1327 resets) in 2917 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1326 resets) in 2922 ms. (136 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1326 resets) in 3079 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1323 resets) in 3210 ms. (124 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1324 resets) in 2966 ms. (134 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (1324 resets) in 2998 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (1328 resets) in 2983 ms. (134 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1328 resets) in 2920 ms. (136 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1329 resets) in 2901 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1327 resets) in 2946 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1324 resets) in 3272 ms. (122 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1329 resets) in 2952 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1323 resets) in 2945 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1326 resets) in 2937 ms. (136 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1327 resets) in 2889 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1324 resets) in 2902 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1324 resets) in 2910 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1323 resets) in 3001 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1325 resets) in 2898 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (1325 resets) in 2907 ms. (137 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1328 resets) in 2949 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1323 resets) in 2914 ms. (137 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 5228190 steps, run timeout after 120001 ms. (steps per millisecond=43 ) properties seen :0 out of 29
Probabilistic random walk after 5228190 steps, saw 1389414 distinct states, run finished after 120011 ms. (steps per millisecond=43 ) properties seen :0
[2025-05-30 02:29:58] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 101 cols
[2025-05-30 02:29:58] [INFO ] Computed 4 invariants in 4 ms
[2025-05-30 02:29:58] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 22/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 202/253 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 46/299 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 86/385 variables, 44/101 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 102/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 2/387 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (OVERLAPS) 0/387 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 207 constraints, problems are : Problem set: 0 solved, 29 unsolved in 2273 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 22/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 202/253 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 46/299 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 86/385 variables, 44/101 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 102/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 29/234 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (OVERLAPS) 2/387 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 0/387 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 236 constraints, problems are : Problem set: 0 solved, 29 unsolved in 8691 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 11045ms problems are : Problem set: 0 solved, 29 unsolved
Parikh walk visited 0 properties in 5161 ms.
Support contains 29 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2224/2224 transitions.
Applied a total of 0 rules in 233 ms. Remains 101 /101 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 101/101 places, 2224/2224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2224/2224 transitions.
Applied a total of 0 rules in 218 ms. Remains 101 /101 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2025-05-30 02:30:14] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2025-05-30 02:30:14] [INFO ] Invariant cache hit.
[2025-05-30 02:30:15] [INFO ] Implicit Places using invariants in 478 ms returned []
[2025-05-30 02:30:15] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2025-05-30 02:30:15] [INFO ] Invariant cache hit.
[2025-05-30 02:30:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2025-05-30 02:30:16] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1678 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/101 places, 2224/2224 transitions.
Applied a total of 0 rules in 233 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2130 ms. Remains : 99/101 places, 2224/2224 transitions.
RANDOM walk for 4000000 steps (32086 resets) in 68182 ms. (58 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1325 resets) in 2969 ms. (134 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1327 resets) in 2947 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1325 resets) in 2939 ms. (136 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (1322 resets) in 2933 ms. (136 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (1325 resets) in 2940 ms. (136 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1326 resets) in 2945 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1325 resets) in 2937 ms. (136 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1329 resets) in 2921 ms. (136 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1326 resets) in 3016 ms. (132 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1324 resets) in 2942 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1322 resets) in 2935 ms. (136 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1328 resets) in 2941 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1329 resets) in 2941 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1323 resets) in 2946 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1326 resets) in 2947 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1328 resets) in 2943 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1327 resets) in 2933 ms. (136 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (1324 resets) in 2947 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1325 resets) in 2933 ms. (136 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1323 resets) in 2939 ms. (136 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1328 resets) in 2947 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1324 resets) in 2942 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1324 resets) in 2946 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1327 resets) in 2944 ms. (135 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1325 resets) in 3988 ms. (100 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1327 resets) in 3534 ms. (113 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1328 resets) in 3141 ms. (127 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1327 resets) in 2864 ms. (139 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1329 resets) in 2858 ms. (139 steps per ms) remains 29/29 properties
Probably explored full state space saw : 1489289 states, properties seen :0
Probabilistic random walk after 5612886 steps, saw 1489289 distinct states, run finished after 118462 ms. (steps per millisecond=47 ) properties seen :0
Interrupted probabilistic random walk after 5369933 steps, run timeout after 120001 ms. (steps per millisecond=44 ) properties seen :0 out of 29
Exhaustive walk after 5369933 steps, saw 1426155 distinct states, run finished after 120006 ms. (steps per millisecond=44 ) properties seen :0
[2025-05-30 02:34:55] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2025-05-30 02:34:55] [INFO ] Computed 4 invariants in 4 ms
[2025-05-30 02:34:55] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 22/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 202/253 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 46/299 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 84/383 variables, 42/99 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 102/203 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 2/385 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (OVERLAPS) 0/385 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 205 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1671 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 22/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 202/253 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 46/299 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 84/383 variables, 42/99 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 102/203 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 29/232 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (OVERLAPS) 2/385 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 0/385 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 234 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5327 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 7054ms problems are : Problem set: 0 solved, 29 unsolved
Parikh walk visited 0 properties in 7125 ms.
Support contains 29 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 231 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 99/99 places, 2224/2224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 229 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2025-05-30 02:35:10] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2025-05-30 02:35:10] [INFO ] Invariant cache hit.
[2025-05-30 02:35:10] [INFO ] Implicit Places using invariants in 456 ms returned []
[2025-05-30 02:35:10] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2025-05-30 02:35:10] [INFO ] Invariant cache hit.
[2025-05-30 02:35:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2025-05-30 02:35:11] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
[2025-05-30 02:35:11] [INFO ] Redundant transitions in 149 ms returned []
Running 2221 sub problems to find dead transitions.
[2025-05-30 02:35:11] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
[2025-05-30 02:35:11] [INFO ] Invariant cache hit.
[2025-05-30 02:35:11] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2221 unsolved
[2025-05-30 02:35:42] [INFO ] Deduced a trap composed of 53 places in 268 ms of which 3 ms to minimize.
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 99/385 variables, and 5 constraints, problems are : Problem set: 20 solved, 2201 unsolved in 30127 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/99 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2221/2221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 20 solved, 2201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 20 solved, 2201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/5 constraints. Problems are: Problem set: 20 solved, 2201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 99/385 variables, and 5 constraints, problems are : Problem set: 20 solved, 2201 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/99 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2221 constraints, Known Traps: 1/1 constraints]
After SMT, in 78074ms problems are : Problem set: 20 solved, 2201 unsolved
Search for dead transitions found 20 dead transitions in 78115ms
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 : 99/99 places, 2204/2224 transitions.
Applied a total of 0 rules in 227 ms. Remains 99 /99 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
[2025-05-30 02:36:30] [INFO ] Redundant transitions in 154 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 80333 ms. Remains : 99/99 places, 2204/2224 transitions.
RANDOM walk for 4000000 steps (32083 resets) in 70993 ms. (56 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1325 resets) in 5241 ms. (76 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1326 resets) in 4991 ms. (80 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1323 resets) in 4938 ms. (80 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1329 resets) in 4791 ms. (83 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1328 resets) in 4770 ms. (83 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1324 resets) in 4636 ms. (86 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (1326 resets) in 4834 ms. (82 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1328 resets) in 4881 ms. (81 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1327 resets) in 4829 ms. (82 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1325 resets) in 4360 ms. (91 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (1327 resets) in 5901 ms. (67 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1324 resets) in 5092 ms. (78 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1329 resets) in 4984 ms. (80 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1329 resets) in 5697 ms. (70 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1324 resets) in 4992 ms. (80 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1325 resets) in 4813 ms. (83 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1327 resets) in 4994 ms. (80 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400000 steps (1325 resets) in 4975 ms. (80 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1326 resets) in 4909 ms. (81 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1326 resets) in 4930 ms. (81 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (1325 resets) in 5240 ms. (76 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1327 resets) in 5055 ms. (79 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1324 resets) in 4824 ms. (82 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1328 resets) in 5023 ms. (79 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1329 resets) in 4927 ms. (81 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (1328 resets) in 4896 ms. (81 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (1325 resets) in 4540 ms. (88 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (1327 resets) in 4679 ms. (85 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (1330 resets) in 4630 ms. (86 steps per ms) remains 29/29 properties
Probably explored full state space saw : 1489289 states, properties seen :0
Probabilistic random walk after 5612886 steps, saw 1489289 distinct states, run finished after 134075 ms. (steps per millisecond=41 ) properties seen :0
Explored full state space saw : 1489362 states, properties seen :0
Exhaustive walk after 5613121 steps, saw 1489362 distinct states, run finished after 135493 ms. (steps per millisecond=41 ) properties seen :0
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK EXHAUSTIVE_WALK TOPOLOGICAL
Total runtime 914946 ms.
ITS solved all properties within timeout

BK_STOP 1748572940657

--------------------
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 StableMarking -timeout 180 -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-V20P10N50"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool gold2024"
echo " Input is BridgeAndVehicles-PT-V20P10N50, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-smll-174853774800223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N50.tgz
mv BridgeAndVehicles-PT-V20P10N50 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;