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.r135-tall-171631131000393.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 DiscoveryGPU-PT-08a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131000393
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 01:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 01:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 12 01:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 28K 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 DiscoveryGPU-PT-08a-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716361265953

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:01:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 07:01:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:01:07] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-22 07:01:07] [INFO ] Transformed 83 places.
[2024-05-22 07:01:07] [INFO ] Transformed 113 transitions.
[2024-05-22 07:01:07] [INFO ] Found NUPN structural information;
[2024-05-22 07:01:07] [INFO ] Parsed PT model containing 83 places and 113 transitions and 363 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 82 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 81 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 81 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 81 transition count 103
Applied a total of 12 rules in 31 ms. Remains 81 /83 variables (removed 2) and now considering 103/113 (removed 10) transitions.
// Phase 1: matrix 103 rows 81 cols
[2024-05-22 07:01:07] [INFO ] Computed 2 invariants in 12 ms
[2024-05-22 07:01:07] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 07:01:07] [INFO ] Invariant cache hit.
[2024-05-22 07:01:07] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-22 07:01:07] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-22 07:01:07] [INFO ] Invariant cache hit.
[2024-05-22 07:01:07] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 103/184 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 63/146 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/184 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 146 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2223 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 103/184 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 63/146 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 102/248 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 248 constraints, problems are : Problem set: 0 solved, 102 unsolved in 1578 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 3855ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 3874ms
Starting structural reductions in LTL mode, iteration 1 : 81/83 places, 103/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4251 ms. Remains : 81/83 places, 103/113 transitions.
Support contains 50 out of 81 places after structural reductions.
[2024-05-22 07:01:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 07:01:11] [INFO ] Flatten gal took : 27 ms
[2024-05-22 07:01:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 07:01:11] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:01:11] [INFO ] Input system was already deterministic with 103 transitions.
Support contains 46 out of 81 places (down from 50) after GAL structural reductions.
RANDOM walk for 40000 steps (463 resets) in 1265 ms. (31 steps per ms) remains 2/39 properties
BEST_FIRST walk for 40002 steps (55 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (59 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
[2024-05-22 07:01:12] [INFO ] Invariant cache hit.
[2024-05-22 07:01:12] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/16 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/46 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/46 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 36/82 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/82 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/82 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 25/107 variables, 13/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/107 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/107 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 17/124 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/124 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/124 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 16/140 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/140 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/140 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 12/152 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/152 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/152 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 8/160 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/160 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/160 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 8/168 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/168 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 8/176 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/176 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/176 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 8/184 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/184 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 0/184 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 146 constraints, problems are : Problem set: 0 solved, 2 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/16 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/46 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 12/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/46 variables, 1/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/46 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 36/82 variables, 13/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/82 variables, 12/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/82 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp38 is UNSAT
After SMT solving in domain Int declared 107/184 variables, and 79 constraints, problems are : Problem set: 2 solved, 0 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/81 constraints, ReadFeed: 29/63 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 7 ms
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 6 ms
[2024-05-22 07:01:12] [INFO ] Input system was already deterministic with 103 transitions.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 225 edges and 81 vertex of which 74 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 74 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 74 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 68 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 68 transition count 90
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 63 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 63 transition count 85
Applied a total of 36 rules in 6 ms. Remains 63 /81 variables (removed 18) and now considering 85/103 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 63/81 places, 85/103 transitions.
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Graph (complete) has 225 edges and 81 vertex of which 74 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 71 vertex of which 56 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Graph (trivial) has 62 edges and 56 vertex of which 32 / 56 are part of one of the 16 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 40 transition count 73
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 35 place count 33 transition count 57
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 42 place count 26 transition count 43
Iterating global reduction 2 with 7 rules applied. Total rules applied 49 place count 26 transition count 43
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 56 place count 19 transition count 29
Iterating global reduction 2 with 7 rules applied. Total rules applied 63 place count 19 transition count 29
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 69 place count 13 transition count 17
Iterating global reduction 2 with 6 rules applied. Total rules applied 75 place count 13 transition count 17
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 81 place count 7 transition count 11
Iterating global reduction 2 with 6 rules applied. Total rules applied 87 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 4 transition count 7
Applied a total of 92 rules in 24 ms. Remains 4 /81 variables (removed 77) and now considering 7/103 (removed 96) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 4/81 places, 7/103 transitions.
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 0 ms
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 0 ms
[2024-05-22 07:01:12] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Graph (complete) has 225 edges and 81 vertex of which 75 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 75 transition count 92
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 70 transition count 92
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 65 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 65 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 64 transition count 86
Applied a total of 23 rules in 11 ms. Remains 64 /81 variables (removed 17) and now considering 86/103 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 64/81 places, 86/103 transitions.
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 74 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 74 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 68 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 68 transition count 90
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 63 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 63 transition count 85
Applied a total of 36 rules in 6 ms. Remains 63 /81 variables (removed 18) and now considering 85/103 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 63/81 places, 85/103 transitions.
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 75 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 75 transition count 97
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 70 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 70 transition count 92
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 65 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 65 transition count 87
Applied a total of 32 rules in 7 ms. Remains 65 /81 variables (removed 16) and now considering 87/103 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 65/81 places, 87/103 transitions.
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 76 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 76 transition count 98
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 72 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 72 transition count 94
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 69 transition count 91
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 69 transition count 91
Applied a total of 24 rules in 7 ms. Remains 69 /81 variables (removed 12) and now considering 91/103 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 69/81 places, 91/103 transitions.
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Graph (complete) has 225 edges and 81 vertex of which 77 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 83 edges and 74 vertex of which 67 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Graph (trivial) has 46 edges and 67 vertex of which 22 / 67 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 56 transition count 86
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 27 place count 51 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 50 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 48 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 48 transition count 70
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 46 transition count 66
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 46 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 46 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 45 transition count 64
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 45 transition count 64
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 44 transition count 63
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 44 transition count 63
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 47 place count 39 transition count 58
Applied a total of 47 rules in 15 ms. Remains 39 /81 variables (removed 42) and now considering 58/103 (removed 45) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 39/81 places, 58/103 transitions.
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 07:01:12] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Graph (complete) has 225 edges and 81 vertex of which 75 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 75 transition count 90
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 68 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 62 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 62 transition count 84
Applied a total of 27 rules in 8 ms. Remains 62 /81 variables (removed 19) and now considering 84/103 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 62/81 places, 84/103 transitions.
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 77 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 77 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 75 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 75 transition count 97
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 73 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 73 transition count 95
Applied a total of 16 rules in 5 ms. Remains 73 /81 variables (removed 8) and now considering 95/103 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 73/81 places, 95/103 transitions.
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 74 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 74 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 68 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 68 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 62 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 62 transition count 84
Applied a total of 38 rules in 3 ms. Remains 62 /81 variables (removed 19) and now considering 84/103 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 62/81 places, 84/103 transitions.
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 103/103 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 74 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 74 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 68 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 68 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 62 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 62 transition count 84
Applied a total of 38 rules in 3 ms. Remains 62 /81 variables (removed 19) and now considering 84/103 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 62/81 places, 84/103 transitions.
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:01:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:01:12] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-22 07:01:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 81 places, 103 transitions and 326 arcs took 4 ms.
Total runtime 5825 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DiscoveryGPU-PT-08a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 81
TRANSITIONS: 103
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.000s]


SAVING FILE /home/mcc/execution/411/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: 540
MODEL NAME: /home/mcc/execution/411/model
81 places, 103 transitions.

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.
Building monolithic NSF...
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716361275368

--------------------
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 CTLCardinality -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="DiscoveryGPU-PT-08a"
export BK_EXAMINATION="CTLCardinality"
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 DiscoveryGPU-PT-08a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131000393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-08a.tgz
mv DiscoveryGPU-PT-08a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;