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.r311-tall-171662335700022.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 QuasiCertifProtocol-COL-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335700022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.7K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 03:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 13 04:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 04:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 72K May 18 16:43 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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716646512140

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 14:15:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 14:15:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:15:13] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 14:15:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 14:15:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 581 ms
[2024-05-25 14:15:14] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 14:15:14] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 3 ms.
[2024-05-25 14:15:14] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
RANDOM walk for 40013 steps (2224 resets) in 1138 ms. (35 steps per ms) remains 12/15 properties
BEST_FIRST walk for 40002 steps (832 resets) in 386 ms. (103 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40005 steps (905 resets) in 235 ms. (169 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (664 resets) in 334 ms. (119 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (657 resets) in 950 ms. (42 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (842 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1291 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (835 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (836 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (835 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (842 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (836 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (844 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 14:15:15] [INFO ] Computed 5 invariants in 9 ms
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-02 is UNSAT
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-05 is UNSAT
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-06 is UNSAT
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-08 is UNSAT
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-11 is UNSAT
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-13 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 6 unsolved
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-00 is UNSAT
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-07 is UNSAT
At refinement iteration 2 (OVERLAPS) 26/56 variables, 30/35 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 8 solved, 4 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-03 is UNSAT
Problem QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-04 is UNSAT
At refinement iteration 2 (OVERLAPS) 26/56 variables, 30/35 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/37 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 37 constraints, problems are : Problem set: 10 solved, 2 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 557ms problems are : Problem set: 10 solved, 2 unsolved
Finished Parikh walk after 72 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=36 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 6 ms.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-25 14:15:16] [INFO ] Flatten gal took : 15 ms
[2024-05-25 14:15:16] [INFO ] Flatten gal took : 5 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-05 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-06 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-13 FALSE TECHNIQUES CPN_APPROX
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2024-05-25 14:15:16] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 16 ms.
[2024-05-25 14:15:16] [INFO ] Unfolded 15 HLPN properties in 1 ms.
RANDOM walk for 40000 steps (2771 resets) in 1199 ms. (33 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (317 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (325 resets) in 911 ms. (43 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (321 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (333 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (317 resets) in 574 ms. (69 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 983276 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :4 out of 5
Probabilistic random walk after 983276 steps, saw 131162 distinct states, run finished after 3004 ms. (steps per millisecond=327 ) properties seen :4
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 176 rows 550 cols
[2024-05-25 14:15:20] [INFO ] Computed 375 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 120/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/528 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 220/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/550 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 176/726 variables, 550/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/726 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 925 constraints, problems are : Problem set: 0 solved, 1 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 360/360 constraints, State Equation: 550/550 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/492 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 120/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/528 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 220/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 14:15:21] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 27 ms to minimize.
[2024-05-25 14:15:21] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 3 ms to minimize.
[2024-05-25 14:15:21] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 3 ms to minimize.
[2024-05-25 14:15:21] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2024-05-25 14:15:21] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2024-05-25 14:15:22] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-05-25 14:15:22] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2024-05-25 14:15:22] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-25 14:15:22] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-05-25 14:15:22] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/550 variables, 20/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 935 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2383 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 360/360 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 3276ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 492 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Applied a total of 0 rules in 27 ms. Remains 550 /550 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 550/550 places, 176/176 transitions.
RANDOM walk for 40000 steps (2769 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (332 resets) in 586 ms. (68 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1003178 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :0 out of 1
Probabilistic random walk after 1003178 steps, saw 133463 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
[2024-05-25 14:15:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 120/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/528 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 220/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/550 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 176/726 variables, 550/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/726 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 925 constraints, problems are : Problem set: 0 solved, 1 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 360/360 constraints, State Equation: 550/550 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/492 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 120/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/528 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 220/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 14:15:27] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
[2024-05-25 14:15:27] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 3 ms to minimize.
[2024-05-25 14:15:28] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 2 ms to minimize.
[2024-05-25 14:15:28] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-25 14:15:28] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
[2024-05-25 14:15:28] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-05-25 14:15:28] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2024-05-25 14:15:28] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-05-25 14:15:28] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-25 14:15:28] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 22/550 variables, 20/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 935 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10181 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 360/360 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 10929ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 492 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Applied a total of 0 rules in 13 ms. Remains 550 /550 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 550/550 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 550 /550 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-25 14:15:37] [INFO ] Invariant cache hit.
[2024-05-25 14:15:37] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-25 14:15:37] [INFO ] Invariant cache hit.
[2024-05-25 14:15:38] [INFO ] Implicit Places using invariants and state equation in 311 ms returned [444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 484 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 539/550 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 539 /539 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 501 ms. Remains : 539/550 places, 176/176 transitions.
RANDOM walk for 40000 steps (2765 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (320 resets) in 772 ms. (51 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1000477 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :0 out of 1
Probabilistic random walk after 1000477 steps, saw 133151 distinct states, run finished after 3001 ms. (steps per millisecond=333 ) properties seen :0
// Phase 1: matrix 176 rows 539 cols
[2024-05-25 14:15:41] [INFO ] Computed 364 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 341/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/517 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/539 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 176/715 variables, 539/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/715 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/715 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 715/715 variables, and 903 constraints, problems are : Problem set: 0 solved, 1 unsolved in 983 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 361/361 constraints, State Equation: 539/539 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/492 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/492 variables, 341/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/517 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 14:15:42] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/539 variables, 20/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 715/715 variables, and 904 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15364 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 361/361 constraints, State Equation: 539/539 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 16430ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 492 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 176/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 539 /539 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 539/539 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 539 /539 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-25 14:15:57] [INFO ] Invariant cache hit.
[2024-05-25 14:15:58] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-25 14:15:58] [INFO ] Invariant cache hit.
[2024-05-25 14:15:58] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-25 14:15:58] [INFO ] Redundant transitions in 4 ms returned []
Running 164 sub problems to find dead transitions.
[2024-05-25 14:15:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 16/528 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-25 14:16:01] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-25 14:16:01] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-25 14:16:01] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-25 14:16:01] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-25 14:16:01] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-25 14:16:01] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-25 14:16:01] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-25 14:16:01] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-25 14:16:01] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-25 14:16:01] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 10/253 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 11/539 variables, 121/374 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-25 14:16:05] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 176/715 variables, 539/914 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/715 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/715 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 715/715 variables, and 914 constraints, problems are : Problem set: 0 solved, 164 unsolved in 17333 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 361/361 constraints, State Equation: 539/539 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 16/528 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 10/253 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 11/539 variables, 121/374 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 176/715 variables, 539/914 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/715 variables, 164/1078 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/715 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 0/715 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 715/715 variables, and 1078 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19173 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 361/361 constraints, State Equation: 539/539 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 11/11 constraints]
After SMT, in 36630ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 36632ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37055 ms. Remains : 539/539 places, 176/176 transitions.
[2024-05-25 14:16:35] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-05-25 14:16:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 539 places, 176 transitions and 1276 arcs took 6 ms.
[2024-05-25 14:16:35] [INFO ] Flatten gal took : 57 ms
Total runtime 81822 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-COL-10

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 698
MODEL NAME: /home/mcc/execution/414/model
539 places, 176 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
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 QuasiCertifProtocol-COL-10-ReachabilityCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716647208151

--------------------
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="QuasiCertifProtocol-COL-10"
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 QuasiCertifProtocol-COL-10, 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 r311-tall-171662335700022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 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 ;