Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r201-smll-171649586500094.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is HirschbergSinclair-PT-25, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649586500094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 321K 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 HirschbergSinclair-PT-25-ReachabilityCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-12
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-13
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-14
FORMULA_NAME HirschbergSinclair-PT-25-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716595421861

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-25
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 00:03:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 00:03:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 00:03:44] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2024-05-25 00:03:44] [INFO ] Transformed 600 places.
[2024-05-25 00:03:44] [INFO ] Transformed 545 transitions.
[2024-05-25 00:03:44] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 431 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (72 resets) in 2062 ms. (19 steps per ms) remains 7/16 properties
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 351 ms. (113 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 624 ms. (64 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 772 ms. (51 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1132 ms. (35 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
// Phase 1: matrix 545 rows 600 cols
[2024-05-25 00:03:46] [INFO ] Computed 55 invariants in 47 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem HirschbergSinclair-PT-25-ReachabilityCardinality-2024-02 is UNSAT
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-25-ReachabilityCardinality-2024-08 is UNSAT
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-25-ReachabilityCardinality-2024-09 is UNSAT
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-25-ReachabilityCardinality-2024-11 is UNSAT
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-25-ReachabilityCardinality-2024-14 is UNSAT
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 429/527 variables, 43/43 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 1/44 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 0/44 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 21/548 variables, 7/51 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 29/577 variables, 4/55 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/55 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 545/1122 variables, 577/632 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1122 variables, 0/632 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/1145 variables, 23/655 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1145 variables, 0/655 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1145 variables, 0/655 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1145/1145 variables, and 655 constraints, problems are : Problem set: 5 solved, 2 unsolved in 2611 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 457/491 variables, 34/34 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 1/35 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-25 00:03:50] [INFO ] Deduced a trap composed of 16 places in 449 ms of which 66 ms to minimize.
[2024-05-25 00:03:50] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 2/37 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 0/37 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/544 variables, 16/53 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 0/53 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 33/577 variables, 4/57 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 0/57 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 545/1122 variables, 577/634 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-25 00:03:51] [INFO ] Deduced a trap composed of 23 places in 471 ms of which 13 ms to minimize.
[2024-05-25 00:03:52] [INFO ] Deduced a trap composed of 60 places in 451 ms of which 8 ms to minimize.
[2024-05-25 00:03:52] [INFO ] Deduced a trap composed of 90 places in 349 ms of which 5 ms to minimize.
[2024-05-25 00:03:53] [INFO ] Deduced a trap composed of 108 places in 202 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1122 variables, 4/638 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1122 variables, 0/638 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 23/1145 variables, 23/661 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1145 variables, 2/663 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-25 00:03:53] [INFO ] Deduced a trap composed of 14 places in 408 ms of which 7 ms to minimize.
[2024-05-25 00:03:54] [INFO ] Deduced a trap composed of 53 places in 425 ms of which 7 ms to minimize.
SMT process timed out in 7824ms, After SMT, problems are : Problem set: 5 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 545/545 transitions.
Graph (complete) has 1148 edges and 600 vertex of which 576 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.5 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 199 rules applied. Total rules applied 200 place count 576 transition count 346
Reduce places removed 198 places and 0 transitions.
Graph (complete) has 686 edges and 378 vertex of which 327 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.2 ms
Discarding 51 places :
Also discarding 0 output transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 213 rules applied. Total rules applied 413 place count 327 transition count 332
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 2 with 65 rules applied. Total rules applied 478 place count 313 transition count 281
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 482 place count 309 transition count 277
Iterating global reduction 3 with 4 rules applied. Total rules applied 486 place count 309 transition count 277
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 489 place count 306 transition count 274
Iterating global reduction 3 with 3 rules applied. Total rules applied 492 place count 306 transition count 274
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 497 place count 306 transition count 269
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 502 place count 301 transition count 269
Reduce places removed 18 places and 18 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 520 place count 283 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 521 place count 282 transition count 251
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 521 place count 282 transition count 240
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 543 place count 271 transition count 240
Applied a total of 543 rules in 314 ms. Remains 271 /600 variables (removed 329) and now considering 240/545 (removed 305) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 271/600 places, 240/545 transitions.
RANDOM walk for 40000 steps (160 resets) in 915 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (41 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (35 resets) in 206 ms. (193 steps per ms) remains 1/2 properties
FORMULA HirschbergSinclair-PT-25-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 240 rows 271 cols
[2024-05-25 00:03:55] [INFO ] Computed 31 invariants in 6 ms
[2024-05-25 00:03:55] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/158 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/262 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/499 variables, 262/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 34/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/510 variables, 8/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/511 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/511 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 271/271 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/158 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/262 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/499 variables, 262/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 34/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/510 variables, 8/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/510 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/511 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/511 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 271/271 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1170ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 25 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 240/240 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 271 transition count 232
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 503 edges and 263 vertex of which 260 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 260 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 20 place count 260 transition count 229
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 259 transition count 228
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 259 transition count 228
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 258 transition count 227
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 258 transition count 227
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 258 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 257 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 256 transition count 225
Applied a total of 27 rules in 81 ms. Remains 256 /271 variables (removed 15) and now considering 225/240 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 256/271 places, 225/240 transitions.
RANDOM walk for 40000 steps (172 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (50 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 694484 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :0 out of 1
Probabilistic random walk after 694484 steps, saw 142913 distinct states, run finished after 3011 ms. (steps per millisecond=230 ) properties seen :0
// Phase 1: matrix 225 rows 256 cols
[2024-05-25 00:03:59] [INFO ] Computed 31 invariants in 8 ms
[2024-05-25 00:03:59] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 130/155 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/251 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 223/474 variables, 251/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 34/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/480 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/481 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/481 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 256/256 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 130/155 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/251 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 223/474 variables, 251/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 34/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/480 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/481 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/481 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/481 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/481 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 256/256 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1566ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 25 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 225/225 transitions.
Applied a total of 0 rules in 18 ms. Remains 256 /256 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 256/256 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 225/225 transitions.
Applied a total of 0 rules in 17 ms. Remains 256 /256 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-25 00:04:01] [INFO ] Invariant cache hit.
[2024-05-25 00:04:01] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-25 00:04:01] [INFO ] Invariant cache hit.
[2024-05-25 00:04:02] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-25 00:04:03] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 2155 ms to find 0 implicit places.
[2024-05-25 00:04:03] [INFO ] Redundant transitions in 18 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-25 00:04:03] [INFO ] Invariant cache hit.
[2024-05-25 00:04:03] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 4/248 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-25 00:04:10] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 2 ms to minimize.
[2024-05-25 00:04:11] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-25 00:04:13] [INFO ] Deduced a trap composed of 2 places in 177 ms of which 4 ms to minimize.
[2024-05-25 00:04:13] [INFO ] Deduced a trap composed of 2 places in 153 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 7/255 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 225/480 variables, 255/290 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 35/325 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 12 (OVERLAPS) 1/481 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/481 variables, and 326 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 256/256 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 4/248 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 7/255 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-25 00:04:41] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 4 ms to minimize.
[2024-05-25 00:04:41] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 225/480 variables, 255/292 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 35/327 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 215/542 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 13 (OVERLAPS) 1/481 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 215 unsolved
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 Int declared 481/481 variables, and 543 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 256/256 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 6/6 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62387 ms. Remains : 256/256 places, 225/225 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 256 transition count 108
Reduce places removed 117 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 121 rules applied. Total rules applied 238 place count 139 transition count 104
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 242 place count 135 transition count 104
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 242 place count 135 transition count 83
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 285 place count 113 transition count 83
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 287 place count 112 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 288 place count 111 transition count 82
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 288 place count 111 transition count 81
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 290 place count 110 transition count 81
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 296 place count 107 transition count 78
Applied a total of 296 rules in 33 ms. Remains 107 /256 variables (removed 149) and now considering 78/225 (removed 147) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 78 rows 107 cols
[2024-05-25 00:05:03] [INFO ] Computed 29 invariants in 3 ms
[2024-05-25 00:05:03] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 00:05:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-25 00:05:03] [INFO ] [Nat]Absence check using 3 positive and 26 generalized place invariants in 33 ms returned sat
[2024-05-25 00:05:03] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 00:05:03] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 00:05:04] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 475 ms.
[2024-05-25 00:05:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-05-25 00:05:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 256 places, 225 transitions and 856 arcs took 12 ms.
[2024-05-25 00:05:04] [INFO ] Flatten gal took : 112 ms
Total runtime 80250 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HirschbergSinclair-PT-25

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/403/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 256
TRANSITIONS: 225
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.003s]


SAVING FILE /home/mcc/execution/403/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 618
MODEL NAME: /home/mcc/execution/403/model
256 places, 225 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 HirschbergSinclair-PT-25-ReachabilityCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716595514606

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="HirschbergSinclair-PT-25"
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 HirschbergSinclair-PT-25, 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 r201-smll-171649586500094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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